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

[@AmeyaKherodkar]

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

[@ce132_sonugupta9]

xor solution explanation is nice🙃🙃

[@nibeditadas4182]

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

[@raju_bugude]

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

[@AnyVine]

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

[@walkwithAziz2024]

Thanks excellent explanation Xor how use in this solution

[@businessmotivationspot]

Hey man! your explanation skills are excellent.

[@nikoo28]

Glad you like them!

[@arundhuti4101]

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!

[@ayushipawar9542]

Yeah it will definitely work but we need optimized code...

[@vishnulavudya3160]

the best explanation

[@AvinashSingh-tr5vt]

Thank you very much for the wonderful explanation 😊

[@priyakoli5572]

You explained so well then others

[@everyontech2716]

This is one of the best explained video for this problem

[@satyamgupta6030]

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.

[@nikoo28]

So nice of you

[@zillboy]

Amazing explanation, thanks 👍

[@rachitkatariya]

Bahut accha padhaye ho bhaiyaa aap.🫂❤

[@HistoryHouse45]

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

[@nikoo28]

let me check it out.. :)

[@sarveshkuthe6283]

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 ?

[@sumitprasad4062]

Sir your explanation is awesome ♥♥♥

[@nobelcoding]

Very nice explanations

[@anudey8496]

like your solution! thanks

[@jjoelthomas]

Great explanation!!!

[@riya_1723]

The best one 😊

[@gd24644]

thank you so much

[@mikedelta658]

Thank you.

[@pavankumarpadamati8606]

good explanation bro..

[@kunalkheeva]

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

[@nikoo28]

glad you liked my content. Yep...I have plans for collabs and live sessions when the time is right :)

[@kunalkheeva]

@@nikoo28 or provide me your insta account I will dm you.

[@nikoo28]

@@kunalkheeva you can email me on the address provided in the channel description :)

[@ghub1971]

thank you sir

[@souleymen971]

Thank you you help me so much

[@nikoo28]

I'm so glad!

[@jameshuddle4712]

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

[@klyucherov.e]

Спасибо индусу за туториал 👍

[@nikoo28]

you are welcome

[@keshav9541]

great bro

[@Mosesdaniel77]

🎉Good

[@priyabratapadhi2421]

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

[@professormoriarty7439]

Is bit manipulation important for interview??

[@nikoo28]

to be honest, it is very unlikely that you will get tough bit manipulation questions during an interview. You are just expected to know the basics, like what is left shift, what is right shift, XOR etc. As an interviewer, I would never ask a programming problem whose solution relies on a bit manipulation technique.

[@vamshisundupalle6141]

can u give the brute force solution pls

[@nikoo28]

have you tried writing some code?

[@vamshisundupalle6141]

@@nikoo28 I tried but I can't got it

[@harikumarv5009]

awsome brother🥸

[@abhasthakur36]

Bruteforce ka code send krdo

[@nikoo28]

You don’t need the code for brute force method

[@chitra_13]

0,1 ka kese niklega iss approch se

[@nikoo28]

What do you mean?? Please elaborate a little

[@demonders5486]

😅😅😅😅😅😅😅

[@RameshGaridapuri]

// Online C compiler to run C program online #include 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(" "); } }