Missing Number (LeetCode 268) | Full solution with visuals and diagrams | Study Algorithms

Using some basic mathematics or a simple XOR operator can help you to arrive at an efficient solution to find the missing number. This problem is important from an interview POV, as it works as an entry gate towards bit manipulations. Understand the problem with the help of beautiful animations and visuals.

Chapters:
00:00 - Intro
00:53 - Problem Statement and Description
03:07 - Brute Force Solution
04:51 - Basic Mathematics is wonderful
07:17 - Using the XOR operator
12:59 - Dry-run of Code
14:42 - Final Thoughts

📚 Links to topics I talk about in the video:
Brute Force Paradigms:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview

[AmeyaKherodkar]

One of the best videos for this problem and logic explanation. Kudos ✌

[nibeditadas]

Great explanation, need more such videos on different Leet code problems.

[arundhuti]

If we add all the nums in the range and then also add the nums in the given array and subtract the sums. we would get the required answer. Wouldn't this be the most efficient way for a brute force method?

btw wonderful explanation, thanks!

[raju_bugude]

best expalnation so far in youtub regarding this topic/problem.

[AvinashSingh-trvt]

Thank you very much for the wonderful explanation 😊

[AnyVine]

Xor pehli baar dhang se samajh aaya h, thanks brother 😊😊

[everyontech]

This is one of the best explained video for this problem

[businessmotivationspot]

Hey man! your explanation skills are excellent.

[satyamgupta]

what an excellent explaination bhaiya . Thanks for making such amazing videos for we student.

I always look for ur videos whenver I search a problem on yt.

[walkwithAziz]

Thanks excellent explanation Xor how use in this solution

[jameshuddle]

Nice! The xor really capped it. Thank you! (I couldn't resist...)
missing = arr.reduce((t, v, i) => t ^ v ^ i, arr.length);

[HistoryHouse]

sir can you make video on another part of this problem(repeat and missing number)

[sarveshkuthe]

What if we use the freq array approach and find max element in array and create the freq array of that size and then increase the index, we can check if the index is 0 then that’s the missing number ?

[priyabratapadhi]

how this "xor " solution can't pass test case

[kunalkheeva]

Hey Nikhil I love your content, do you have any plans for collabs? Like live problem solving and whatnots?

[professormoriarty]

Is bit manipulation important for interview??

[vamshisundupalle]

can u give the brute force solution pls

[RameshGaridapuri]

// Online C compiler to run C program online
#include <stdio.h>

int main() {

int arr[] = { 1, 5, 9, 100 };
int m = 0;
int size = sizeof(arr)/sizeof(int);

for (int i = 0 ; i< size ; i++)
{
for (int j = m+2 ; j < arr[i+1]; j++)
{

if ( arr[i] != arr[j])
{
printf(" %d", j);
}
m = j ;
}
printf("\n");
}
}