LeetCode | Task "136. Single Number" | Python solution
136. Single Number
Easy
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.
--------------------------------------------------------------------------------------------------------------------
Example 1:
Input: nums = [2,2,1]
Output: 1
--------------------------------------------------------------------------------------------------------------------
Example 2:
Input: nums = [4,1,2,1,2]
Output: 4
-------------------------------------------------------------------------------------------------------------------
Example 3:
Input: nums = [1]
Output: 1
------------------------------------------------------------------------------------------------------------------
Similar Questions:
Single Number II - Medium
Single Number III - Medium
Missing Number - Easy
Find the Duplicate Number - Medium
Find the Difference - Easy
---------------------------------------------------------------------------------------------------------------------
Related Topics: Array, Bit Manipulation
On this page of the site you can watch the video online LeetCode | Task "136. Single Number" | Python solution with a duration of hours minute second in good quality, which was uploaded by the user PythonLeet Code 28 August 2023, share the link with friends and acquaintances, this video has already been watched 8 times on youtube and it was liked by 0 viewers. Enjoy your viewing!
