Leetcode - Two sum solution explained in Javascript & Java | Coding interview question 

best explanation Broh❣️

Good explanation sir

Best explanation I have seen so far

Ah I was so close, I got an O(n) * 2 looking at the whole array twice and setting the difference as map key, and the current value as value; I like your solution much better!

Great explanation. Thank you for sharing!!

why is there a need for map.set(num[i], i); ? does it help with updating the 'diff' in the loop?

you're explaining so well. would you please continue the series? 🥲it's very helpful ✨really like the way you explained the problem