← Questions
Two sum
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an integer array and a target, return the indices of the two different elements that add up to the target; exactly one such pair exists. Then solve it without a hash map (for example by sorting indices and walking two pointers) and compare the costs.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding