LeetCode 136 Explained | Find Unique Element Using XOR 💡

“Hello everyone 👋 In this video, we are solving LeetCode Problem 136 – Single Number using the most optimal approach. 🔍 Problem Summary: You are given an integer array where every element appears twice except for one. Your task is to find that single unique element. 🚀 Approach Used: We use the XOR (^) operator trick: a ^ a = 0 a ^ 0 = a This helps us cancel out duplicate elements and get the unique number in O(n) time and O(1) space. 💡 Why this is important? This is one of the most frequently asked interview questions and helps you understand bit manipulation concepts clearly. ⏱ Timestamps: 00:00 Introduction 00:30 Problem Explanation 01:30 Approach (XOR Logic) 03:00 Code in C++ 05:00 Dry Run 07:00 Complexity 💻 Language Used: C++ 📌 Complexity: Time: O(n) Space: O(1) 👍 If you found this helpful: Like 👍 | Share 🔁 | Subscribe 🔔 #️⃣ Tags: #leetcode136 #singlenumber #dsa #codinginterview #cpp #bitmanipulation #placements #leetcodeeasy