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

[@viveknath6073]

best explanation Broh❣️

[@Heavenly_JesuschrisT]

Good explanation sir

[@vladventura1928]

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!

[@mscofield9925]

Best explanation I have seen so far

[@Courtney-yk2be]

Great explanation. Thank you for sharing!!

[@jingkangloh7710]

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

[@geoffreylee1780]

it need to store the pair of (key and indice) for future loop comparison

[@nikithanikki3398]

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

[@ShawnCTech]

Glad you like it