LeetCode 136 : Single Number

preview_player
Показать описание
Hi,
In this video I will be solving a leetcode problem 136 : 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.



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
Рекомендации по теме
Комментарии
Автор

Didn't knew Zakir Khan also teaches leetcode problems lmao 😂😂

ajkc
Автор

Very nice tutorial, I almost forgot about use of bitwise operators in array elements.

swetabjahazra
Автор

Hey Pushkar, I have been following you on LinkedIn and learnt a lot. Looking forward to learn more from your channel. Thank you!

suryakumar