Qualcomm OA Question 2024 June | Bit Manipulation | on-campus

Question: Single Number Problem Statement 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. Constraints 1 <= nums.length <= 3 * 104 -3 * 104 <= nums[i] <= 3 * 104 Each element in the array appears twice except for one element which appears only once. Examples Example 1: Input: nums = [2,2,1] Output: 1 ...