Two Sum (LeetCode #1) | 3 Solutions with animations | Study Algorithms

[@nikoo28]

At 12:58, I am supposed to add "8" to the hash table and not "11". Sorry for the error.

[@atharvalaad8926]

😅😅😅😅😅😅😅 15:52 😅😅😊😅😅😅 15:52 15:52 15:52 15:52 15:52 😅 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 😅 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 15:52 😅 15:52 15:52 15:52 15:52 15:52 15:52 15:52

[@halimaomar9820]

This is absolutely the best explanation on KZbin. Everyone else goes straight to coding and doesn't break down the logic beforehand.

[@nikoo28]

Happy that I could help :)

[@AKASH-fe6vy]

So nice of you to put this in a simple yet insightful manner, thanks a lot.

[@billyfigueroa1617]

Excellent content. This is the second video I watch which allows one to be able to devise a nicer solution simply by sorting the array. The hash map solution is genius and is not complicated I will now, always look at a problem and find out how I can solve it by first thinking "Would sorting this array help to simplify the solution"

[@nikoo28]

Awesome, thank you!

[@billyfigueroa1617]

@@nikoo28 you are welcomed

[@ayushtalks2.0]

One of the best way of teaching . Sir Keep posting more videos of dsa. 👍👍

[@nikoo28]

Thank you so much for your support :)

[@Spear_of_Boudicca]

Good video, very similar to my university lectures. I think the reason a lot of people fail to learn some things on their own is that they just see code and want to understand it magically, you need to get the logic behind stuff.

[@wenkaiyang1487]

thank you soooo much! I checked out so many videos about this question. finally your video helped me out! firmly subscribed to your channel

[@aman_rockstar31]

you r really an excellent teacher one thing i want to tell ur explanation is better that striver thanks for providing such videos

[@Karan-ow4wl]

Best Video Explanation so far !!!

[@Rockstar-16]

Sir😄, I have no words, I have never seen anyone explain this nicley, thank you so much❤

[@nikoo28]

Thank you so much for your kind words.

[@harihardhik3293]

Such a great way of explaining this problem. You have redefined teaching sir!!! Amazing Work!!!!

[@nikoo28]

Thanks a ton

[@yowanehakuuu]

I watched two other videos before coming here , to be honest you are the best one . I only understand from you because other people talk too long without explaining they talk about the problem not the solution. You even taught me the math side of this . Thank you , I subscribed. I will watch the rest of the solutions

[@nikoo28]

I prefer to focus on the problem. Language is a tool anyway, and they will keep changing and evolving. Thanks for the sub!!

[@bobbysokhi7296]

Underrated channel.

[@sarthakgadge5223]

Thanks a lot, I was able to understand this problem thanks to your efforts.

[@sahilhansofficial]

Love the way you teach, TYSM☺

[@elizabeth00653]

Thank you for taking the time to create this video and make a clear explanation

[@pooja3711]

you are the best.I really appreciate your hard work and step-by-step approach to how to overcome with a solution. Hats off

[@nikoo28]

thanks for the appreciation and motivation :)

[@brahmithegod9558]

I was searching for the solution but do not found dryryn but u did it thank bro ❤️

[@shacks-b3b]

Please keep uploading DSA/leetcode videos, they all are really helpful, thanks!

[@nikoo28]

More to come!

[@KaisarAnvar]

You're by far the most detailed explainer I've seen. I've seen a few, but you're really amazing. Having a coding interview soon.

[@nikoo28]

All the very best for your upcoming interviews :)

[@joshuajacobs6855]

Only just got into coding a few days ago coming from a teacher background. Great explanations!

[@RajKumar-li8dc]

Best way to teach sir plz discuss more question and make a proper playlist ❤❤❤

[@nikoo28]

Check out my playlists in the channel :)

[@kishanbhadoriya8701]

Thank you very much, finally understood

[@bivinnandhu781]

Thank you bro you do grate things your explanation is very simple and easy to understand Iam so happy to see this video

[@nikoo28]

so happy to read this

[@japaneseger]

You explained it very well, best video out there regarding this solution!!"!!!!

[@TV-wk7oo]

Thank you, you are the best! Visualizing the code helped me a lot

[@nikoo28]

You're welcome!

[@1tav0]

Thank you for the video it really helped me!

[@girdharipatel2]

your explanation is for more better than other youtuber

[@nikoo28]

Glad you feel that way :D

[@206_dindayalpatra3]

Thank you ❤

[@malkitsaggu]

Best explanation 👌

[@coldcases_2]

sir @nikoo28 ,there is a mistake in two pointer approch i think where if => num1 and num2 are the same (e.g., nums = [3,3], target = 6), so code will return the same index for both numbers, especially if there are duplicates in the original array. for ex nums = [3,3] target = 6 Output [1,1] Expected [0,1] which is wrong so should we apply something else here?

[@dineshpatil6698]

such clear explantion , subscribed

[@AbhishekRamola-u7y]

Kudos! Great explanation brother.P.s: Bro, you sound exactly like Pennywise from It.

[@pulastyadas3351]

awesome explanation..keep teaching us

[@manjunathakaliwalLife_Atlanta]

Good one

[@aniketpurohit7601]

Amazing

[@prakharpathak5899]

Very smooth sir

[@sanjeewagunarathna1990]

Great video best explanation

[@AkaNuclear]

For the second solution where we are using hashmap, the time complexity of finding an element is also O(n) in case of hash collisions

[@nikoo28]

For a very big input size, yes there will be collisions…but for the domain of this problem you should be just fine. Good to discuss this with your interviewer though 😄

[@kunalkheeva]

thank you for a great explanation, what would be its space complexity?

[@nikoo28]

Which solution do you want the space complexity for? :)

[@04.nehalsingh12]

awesome tutorial sir

[@anchalsoni8614]

awesome video... keep making them

[@juledoc_07]

I had a question about the tastable, 19-4 is 15, but it is on the table so why don't we stop there? Thank you

[@Samtoosoon]

Best

[@jst8922]

06:03 - Method 1: Using Sorting This is basically sliding window solution, when you have two pointers , left and right and you move them correspondingly.

[@dipanwitasahoo6643]

Is this possible using binary search?

[@lipovgaming7245]

but how do you return 2 elements.

[@sunnyrajesh]

Hello I have a small doubt ? How we return two index values here map.get(complement),i); Can any one explain 🤔 does it return complement index and current I value ?

[@im_andre6dev56]

Hi Nikhil, what program do you use to draw the solution?

[@nikoo28]

GoodNotes 6

[@Programming-for-all-u2l]

I do not know why he gets very few likes and he is the best teacher for explaining the leetcode problems

[@nikoo28]

so happy you believe in me. Please share the videos if possible. Trying my best with SEO to get ranked up in search results.

[@ashishsonii]

Brother don't stop making leetcode questions​@@nikoo28

[@ganesang7217]

its cool

[@ymhuang651]

Awesome channel! Why I Find it so late?

[@nikoo28]

Glad I could help you 😄

[@karthik-varma-1579]

AT 10:31 the method is not working for negative numbers in the array;

[@nikoo28]

the optimized method takes care of all different test cases

[@karthik-varma-1579]

@@nikoo28 Ohk Thanks Sir

[@sushant3530]

Sir will 3rd Method will work if array has Duplicate elements . Becoz in HashMap , the key cannot be duplicate. And if array elements repeats , they duplicate key is found. PLZZZZ PLZZ EXPLIAN THIS SIR

[@nikoo28]

since the problem says you will have EXACTLY ONE SOLUTION, you do not need to worry about duplicate number. Because if a duplicate number exists, then you will have 2 possible solutions...and hence that is not a valid scenario.

[@ashishkumaryadav7701]

@@nikoo28 but in the example there is repetitive element

[@RapJunkie]

@@nikoo28 we have a valid scenario [3,3], and this method won't work :(

[@powerball200]

bro plz do in python

[@shwetamandal6616]

what is this """'' return new int[]{map.get(complement),i}; """" ? as it throws error and i am getting you've used curly brackets with new int[]...................please reply..........................

[@nikoo28]

It gets the complement pair and then returns it as an array.

[@IorgaArtStudio]

subbed!

[@kashmirviews4332]

Can anybody tell how to write the main function code for the same function.

[@nikoo28]

Just create an object of the class and call it in the main method

[@kashmirviews4332]

@@nikoo28 thanks.

[@ME022GopinathanAsokan]

sir what language you are used here

[@nikoo28]

Java

[@ashishsonii]

Dont stop DSA questions

[@abhinavd2]

100

[@YNKeerthi-ry6jx]

koko eating banana 875 leetcode question

[@nikoo28]

It is available now: kzbin.info/www/bejne/gHi8iYGmj8aKaLcsi=2ftslOTD1LCE8-r2