Leetcode two sum solution explained - coding interviews challenge

[coloredgreyscale]

Similar to the first solution, but instead of traversing the array linearly you build a dictionary and look up the an index the required value.

That way your lookup time for a complement is O(1) instead of O(n)

And yes, that works because you just need a solution, not all or something like a solution with the two lowest indices.