Two single numbers
In an array where every element appears exactly twice except for exactly TWO elements that appear once, find those two single numbers. Return them as a list sorted ascending. Use O(n) time and O(1) extra space. Array length is even, 2..100000, values fit in 32-bit signed ints (non-negative for this problem).
Implement
single_number_iii(nums: list[int]) → list[int]Examples
in
[[1,2,1,3,2,5]]out[3,5]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,2,1,3,2,5]][3,5]not run yetsample