Single Number - Leetcode 136

In this video, we solve LeetCode Problem #136 – Single Number, one of the most popular interview questions asked at Amazon, Google, and Meta.

We'll cover:

Problem explanation
Optimal solution using XOR Bit Manipulation – O(n) time, O(1) space
Step-by-step code walkthrough
Why this trick works (intuitively explained)

Timestamps
00:00 Intro & problem overview
02:30 Frequency Array Solution - [O(m) Space]
12:30 Map Solution - [O(n) Space]
19:24 XOR Solution - [O(1) Space]

Connect with me:
ahmed.fathi.aziz@gmail.com

This problem is part of my LeetCode Problems Series – where I break down real interview questions clearly and efficiently.

https://youtube.com/playlist?list=PLmI9PKPMy0C74cA6FyoohF0iHIBy9dCCJ&si=9lTBPPo2syiYWvni

Problem Link:
https://leetcode.com/problems/single-number/description/

Problem Solution:
https://github.com/AhmedFathi-Aziz/LeetCode-solutions/tree/main/Problems/Single%20Number
#LeetCode #LeetCode136 #SingleNumber #BitManipulation #XOR #AmazonInterview #CodingInterview #DSA #InterviewPrep #CompetitiveProgramming #DataStructures #Algorithms #ProgrammingArabic

Видео Single Number - Leetcode 136 канала Ahmed Fathi