Number occurring odd number of times | Data Structures & Algorithms | EduUdr | By Satadru

The following question can be solved using above algorithm:
Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Example 1:

Input: [2,2,1]
Output: 1
Example 2:

Input: [4,1,2,1,2]
Output: 4

Code in Python3 given in the comment section

[EduUdrIndia]

Code:


class Solution:
def singleNumber(self, nums: List[int]) -> int:
m=0;
for i in nums:
m=m^i;
return m;