Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.
Asked at 13 companies
AdobeAirbnbAmazon
Hints
1.Think about what data structure fits Single Number
2.Consider the brute force complexity and how to optimize