← Questions
Two sum with the lexicographically smallest index pair
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 a pair of indices i < j whose values add up to the target. When several pairs work, return the lexicographically smallest one (smallest i, then smallest j). Do it in one pass with a hash map.
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