Problem
Given an integer array nums, return all values that appear more than once. Each duplicate should appear only once in the output, in the order it is first detected as a repeat during a left-to-right scan.
Constraints
1 <= len(nums) <= 10^5-10^9 <= nums[i] <= 10^9- Each duplicate value should appear at most once in the result
Practicing as: Mobile Engineer interview at ButtonHi, I'll play your Button interviewer for the Mobile Engineer role. Candidates describe these interviews as mostly positive and moderately difficult, so expect me to be friendly and conversational. Take your time with the question above and answer like we're in the room.
You are practicing as a guest. Sign up free to run your code against the sample data. Your draft stays right here.
