This Easy FAANG Interview Question is AWESOME! | Contains Duplicate II - Leetcode 219

dynamic programming, leetcode, coding interview question, data structures, data structures and algorithms, faang

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[wildfan]

Greg you the goat. Always clear and to the point

[dantemix]

Thanks man. I'm learning a lot from you. Just love your videos.

[mateuszobrzut]

What about having set with k last elements?
It would reduce space complexity from O(n) to O(k) - it makes especially sense if k is much smaller than n

Removing i-k element from set after doing set will make the job.

[tamemister]

Nice, I like that solution a lot, all I could think of was brute force

[bssandeep]

I am just a beginner greg but still your videos motivates me to learn more keep going!!

[UncleJemima]

hashmap, the answer to all interview questions

[efthymew]

Do you need the abs? Won't the index stored in the map always be less than the next hit? Or am I tripping

[Wladyslaw]

Is there a shorter way?
As someone who struggles a lot can’t I just do something like:
for i in range(arr):
if int(arr)**2: return True
else:
False

[casperhansen]

A sliding window: O(N-k)
var max = nums.length - k;
for(var i = 0; i < max; i++)
if (nums[i]==nums[i+k])
return true;
return false;

[SekaReal]

Can I hear why just comparing for every element - distance for array[i] and aray[i+k] is bad idea?

[TheViral_fyp]

Brother with js we can learn DSA its easy are complex??

[Saheryk]

better. You have a queue and you store only k values.

[xingyuxiang]

Like in the anime, the hero can arrive in City 1 with a skill index of 0 or a skill index of 4. Then, the hero can leave City 1 with a skill index of 0 or a skill index of 4. Switch on, Switch off. Forward and backward.

[ismailseif]

As a competitive programmer, this is laughable, also, I can make your code exceed the time limit as the default hashmap doesn’t have the best hash function