Leetcode Solution | 217. Contains Duplicates | Javascript | 2/75

I'm Back, this is the 2/75

I release Videos every Monday @ 9:00 AM Eastern; Feel free to hit that like and subscribe to make sure you are made aware when the new vids drop !

This is a more detailed explanation of one of my older videos but I think its critical. I go over the complete thought process of how to optimize. Hope you enjoy.

----- Chapter ----
0:00 - Intro
0:55 - Question
2:09 - Talk through solution
4:46 - Code solution #1.
11:25 - Code Solution #2.

Only first 50 People

[adammescher]

Currently going through your videos during my job search process and I haven't landed the job yet but your videos are helping me build the skills necessary to perform with confidence during the process.

Thank you for sharing your knowledge with the world!

[leroysaldanha]

subscribed! keep going manh, great video!

[chiho]

Best teacher out there, very cool that you show us how to improve the code in a different way. This helps me a lot for sure.

[UsefulProgrammer]

Thanks ThinkFWD - These videos are helping me understand time and space complexity.

[javierruelas]

Thanks for the walkthrough! I really like the format.

[jasminepvodevtech]

amazing explanation of the logic and different solutions for time/space complexity.. thank you so much!!!

[SethuSenthil]

This is how I did it! But you can also use sets which is better i believe

[TheCasualGamer]

The more jalva script way of doing this converting the given array in to a set and comparing both and if they are not equal return true

[OnEwHoRiDesLinEs]

thanks very much for putting these out here. when i wrote this exact code (solution #2) in leetcode, i got a 'runtime faster than 43%' and 'memory less than 16%'. Why are they so different from your percentages?

[jassminherrera]

what is your professional background? Im curious because your videos are so good!