XOR Trick

Category: Bit Manipulation

Difficulty: intermediate

Description: Find single number using XOR

Time Complexity: O(n)

Space Complexity: O(1)

Related LeetCode Problems

• 136. Single Number (Easy)
• 137. Single Number II (Medium)
• 260. Single Number III (Medium)
• 268. Missing Number (Easy)
• 389. Find the Difference (Easy)
• 461. Hamming Distance (Easy)
• 476. Number Complement (Easy)
• 201. Bitwise AND of Numbers Range (Medium)
• 190. Reverse Bits (Easy)
• 191. Number of 1 Bits (Easy)
• 231. Power of Two (Easy)
• 421. Maximum XOR of Two Numbers in an Array (Medium)
• 898. Bitwise ORs of Subarrays (Medium)
• 1310. XOR Queries of a Subarray (Medium)