One of the Amazon's commonly asked interview questions according to Leetcode.
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
Follow up: Could you implement a solution with a linear runtime complexity and without using extra memory?
Example 1:
Input: nums = [2,2,1]
Output: 1
Example 2:
Input: nums = [4,1,2,1,2]
Output: 4
Follow me on Github:https://github.com/Gokulesh2001
Follow me on LinkedIn:https://www.linkedin.com/in/gokulesh-k-a-13a16b199
Download
0 formats
No download links available.
SINGLE NUMBER | AMAZON | LEETCODE | TAMIL | NatokHD