← Questions
First value seen twice in a left-to-right scan
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Walk an integer array from left to right and return the first value you meet for the second time, or -1 when no value repeats. The answer is decided by where the second occurrence happens, not by the smallest repeated value. Give the hash-set solution and discuss what you would do with no extra memory.
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