Single Number
Problem Statement
Given a non-empty array of integers nums, every element appears twice except for one. Find the element which appeared once in the array.
Example 1
nums = [1, 1, 9, 9, 2, 2, 3]
output = 8
Example 2
nums = [1, 2, 2, 3, 3, 1, 5, ...
sonukumarsaw.hashnode.dev4 min read