Find the Repeating and the Missing Element | Love Babbar DSA Sheet | Leetcode | Amazon 🔥| Placement

#sorting and searching #competitiveprogramming #coding #dsa
Hey Guys in this video I have explained with code how we can solve the problem 'Find the repeating and the missing element'.
Roadmap for Dynamic Programming = • Complete Roadmap for D...
Great Strategy to solve DSA = • Great Strategy to solv...
String question Playlist = • Love Babbar DSA 450 Qu...
Array question Playlist = • Love Babbar DSA 450 Qu...
Binary Tree question Playlist = • Love Babbar DSA 450 Qu...
Dynamic Programming question Playlist = • Love Babbar DSA 450 Qu...
My Journey to 5 star at codechef = • My Journey to 5 Star a...
Love Babbar DSA Sheet : drive.google.com/file/d/1FMdN...
Hope you like it. Comment if you have any doubt
LIKE | SHARE | SUBSCRIBE

[@tanmaythaker2905]

What an explanation! Loved it

[@bea6033]

it was difficult t follow where it started what actuall you did randomly picking index i had to see it 7 times to understand

[@manishrajwani3195]

Loved it. Found this explanation unique and amazing ❤️

[@manishjaiswal8597]

your way of explanation is exellent,thankyou

[@suchithkumar1473]

unique and amazing explanation...thank you

[@mohitsharan3900]

Mast explain krte bhaiii!!!!!

[@PankajGupta-gh9cm]

what if we are not allowed to modify the array element ??

[@arshpreetkaurtiwana2628]

Then make a temporary array and initialise it with zeroes,traverse the array mark the visited values as negative or one in temporary array...if we got already marked index in temporary array than it is repeating element,now after this traverse the array and check if there is any index left with value zero than that will be missing element....t.c.-o(n)...but s.c.-o(n)

[@abhaychaturvdi]

best explanation , thankyou

[@saumitragupta3560]

Loved it ... big fan apka

[@varshasomanath6387]

Amazing explanation bro 👍

[@Sumeet_100]

Thank You for this Video !!

[@abacas2175]

How u think like that..how I develop my logical thinking..

[@prempatel2943]

what an approch brother great

[@harshitavyas7497]

what a logical thinking!!!!! hats off

[@suvigyabasnotra7378]

in the second for loop, we should have stored b = arr[i + 1] for the value, why did you store the index in it...?

[@krishnagarg2583]

to find the missing element

[@Codebreaker0702]

if i'm trying to do this question using 1 based indexing....It is giving me segmentation fault...Do u know why?

[@gokulnaathbaskar9808]

Nice explanation!

[@arpitasingh6849]

Bhai can we not optimize this because it takes n2 time complexity
I think we can use only one for loop or both operation perform in one for loop ......

[@krishanpratap3286]

bhayiya agar jaise array is [3,1,2,1] toh isme kaise cycle banaye?

[@thelostinshan]

thanks

[@atanujana8119]

I think we should use cycle sort

[@BljtKuntal]

if(arr[abs(arr[i])-1]

[@brijbhusanpandey6745]

arr[-1] won't happen because range always 1 to N. So arr[-1] will not appear at most arr[0] will come

[@ritikjalal117]

pls make a video on kmp algo pls pls

[@devgrewal1701]

agar elements 10 sa start hora to fir kasa nikala ga bhai

[@kritisharma5371]

Time complexity O(N*N) hojaegi na 2 for loop lgae h jb

[@ankitdwivedi4213]

nahi bhai dono loop separate hai to complexity add hogi O(N)+O(N)

[@mridulsarma9022]

I have one qstn in this

[@anshsrivastava8754]

Accha, tum Yogesh ho, Shaliesh, Vishesh, Akhilesh, Mithilesh, Ankesh and Durgesh kaha hai?

[@CodeLibrary]

sirf 2 hi hai bro Yogesh and Shailesh

[@aryanchaurasia3042]

Sir please question ka pdf share kar digiye

[@suchithkumar1473]

drive.google.com/file/d/1FMdN_OCfOI0iAeDlqswCiC2DZzD4nPsb/view

[@meetbrahmbhatt480]

You are making it too complicated bro