Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3

Notes/C++/Java/Python codes in Step 3.1 of bit.ly/tufA2ZYt
Find the missing number: takeuforward.org/arrays/find-...
Maximum Consecutive Ones: takeuforward.org/data-structu...
Find the number that appears once, and the other numbers twice: takeuforward.org/arrays/find-...
Problem links.
Find the missing number: bit.ly/3ZdwAkN
Maximum Consecutive Ones: bit.ly/3ZFZji5
Find the number that appears once, and the other numbers twice: bit.ly/3VOlEHp
We have solved the above problems, and we have gone from brute force and ended with the most optimal solution.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Introduction of course
0:57 Missing Number
18:16 Code-compiler (Missing Number)
18:44 Maximum Consecutive number of 1's
21:06 Code-compiler (Maximum Consecutive number of 1's)
22:49 Find the number that appear once and other number twice
36:40 Code-compiler (Find the number that appear once and other number twice)

[@takeUforward]

Let's march ahead, and create an unmatchable DSA course! ❤ Use the problem links in the description.

[@Vijaykrishnan2000]

Find the number that appear once and other number twice : (Partially Accepted) needed binary search approach ?

[@ayushsaurav38]

bro u use map in array series and in course series so atleast give a short intro of whatever u r using the course bcz this course is for beginners as u said

[@PHANTOMWORLD]

@@Vijaykrishnan2000 binary search requires sorting and sorting takes O(nlogn) so how it is more optimal ?

[@subrajeetmaharana]

@@PHANTOMWORLD the given array is sorted. No need to sort it.

[@itsmrcrazy7670]

@@Vijaykrishnan2000 bro have you found soloution for this

[@ariobotgaming]

In an interview, I personally feel jumping to "better" solution is good, instead of "brute" solution, if "better" exists that is. Reasons: - I dont think the time constraint allows for us to cycle through all three(brute, better, optimal) in 45min-1hr time window (usually 2-3 questions can be asked). - Also brute are confusing at times, as it mostly involves combining many steps at times and the dry run will take time, so will the psuedo code. - We must also account the stress of the interview, I don't think I can come up with different version of solutions for a single question without messing up the flow (which might ruin the concentration and cause panic). So I think its better to give a solution that you know it works for sure.

[@Josuke217]

Agreed 💯

[@karthik-varma-1579]

The Striver Approach is good for learning process and it will be helpful to think for good solution... but in interview's they expect us to solve the problem(in less time constraint ) so we explain the Better Approach and we Optmize it to Optimal Approach to interviewer and directly jump into the optimal code. so this is good pathway we should follow in the interview. SO ask the interviewer for time given to solve this solution . Mostly Try to jump into the direct optimal solution.

[@sharathkumar8338]

are you planning to put Scaler Academy out of business.?? 😆😆

[@shubhamKumar-mb6he]

Bhai matt has itna daant bahar nikal jayega

[@abhishekg2766]

Bruhhh they take training from him lamo

[@Akash-yr2if]

Striver shouting top oof voice and these DSA problems are getting slightly one after the other in my head. Thanks Striver

[@actuallynxiss]

I absolutely love your videos man! I understood everything very well. Internship season is gonna start very soon in my college and this helps me a ton!

[@reki7247]

you're the best, man! hats off to you for great teaching and concepts that you elaborate so smoothly, i'm second year btech student and i am so thankful to have found you! ever since you came to my college for techtalk i've been motivated and a fan of yours, keep up the good work!

[@ParasSharma-mf8or]

0:00 Introduction of course 0:57 Missing Number 18:16 Code-compiler (Missing Number) 18:44 Maximum Consecutive number of 1's 21:06 Code-compiler (Maximum Consecutive number of 1's) 22:49 Find the number that appear once and other number twice 36:40 Code-compiler (Find the number that appear once and other number twice) Please please please maintain consistency it's a humble request from the bottom of my heart 🙏🙏.

[@alwayshemanthreddy]

0:11 motivation 😅 required too

[@merlingrace6850]

You did a great job.... I used to afraid of dsa at first but the day I find your channel, I'll be more confident now to clear dsa rounds . Your hard work deserves a lot Striver. You explanation is crystal clear and it's keep us engaging with each step of concept.

[@user-oi1oe5he5r]

we learn concept but forget again ,bcs there are lots of problems and concepts

[@helloworld2054]

Understood everything, you are one of a kind Striver!

[@Deena_Bandhu]

bhaiya its mean a lot for us who can't afford a course...! and providing this level of lectures such a next level....! i will try to be a like you in future so i can help the peoples in other way....! thank you bhaiyya

[@shubhamagarwal1434]

#Free Education For All.. # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India....

[@AarzooBansal]

Thank you for all your videos! You have no idea how much these are helping everyone out there!!

[@gwatsinthong3180]

Thank you Sir 🙏 Truly the way you explain is really easy to understand. It is hard to believe such a great man exist that gives such great quality material for free

[@rahulkathayat8542]

Love your content striver keep blessing us with such amazing videos

[@cinime]

Understood! Amazing explanation as always, thank you very much for your effort!!

[@GB-su9gu]

you are real hero for me. best teacher like done 😊

[@pranavrakhunde]

For the last problem Find number that appear once and other twice the below code passes all the 11 test cases int getSingleElement(vector &arr){ int ans = 0; for(int i=1;i

[@user-oi1oe5he5r]

nice

[@rudrsharma4758]

that solution is wrong, it won't give correct output for cases like [0, 1, 0, 1, 2] in this case at the first iteration for i=1: arr[1-1] != arr[1] is true and thus it will return arr[1-1] as output, which is 0, whereas the correct output is clearly 2.

[@user-kk2pk2cd9c]

@@rudrsharma4758 It is sorted array though.

[@akshitrajputhere]

Thanks mate this does work

[@Josuke217]

Extraordinary way of teaching. I never thought I would be able to solve all these questions quickly. Thanks man

[@tabrezahmed1000]

Corrected code for missing numbers: class Solution { public: int missingNumber(vector& nums) { for(int i = 1; i

[@PrithaMajumder]

Raj, Thanks a lot for This Amazing Video about C++ Arrays Video - 3 Completed ✅

[@055_meetmakwana9]

Absolutly loved it, for the first problem in this video, I actually tried to solve it on my own, and thought of an solution which turns out to be a optimal solution you metioned here in this video, this is not a small achievement for me😃. Thank you striver.

[@john_doe_2231]

Hey Striver , i had a question since you're working in Europe.Do European tech companies also ask a lot of DSA in their interviews or is it more focused towards other topics like design ,LLD etc ? Would really love a video on this .

[@jishnuraj2278]

Understood! Amazing Explanation!

[@aashishas7044]

The video and material were awesome. thanks for your efforts.

[@Viratrohit184]

Thankyou striver for your hardwork to make me understand your efforts make me work hard

[@itzmartin20]

Understood! You make my day again brother!

[@himadriroy7980]

Understood!! Loved the lecture.

[@dhruvsolanki4473]

Super amazing videos and explanations.

[@virendrakumarmishra876]

amazing just loved it so clear explanation 😍

[@AJDJ108]

Understood each concept brother we need this kind of video 🎉

[@varunvarun5723]

Thanks for the amazing content striver

[@Ishantkumar-cr6ug]

understood bhaiya...we need more videoes in a week, and get well soon..

[@saikrishnaganguri]

Understood, Thank you so much for the awesome content..

[@habeeblaimusa4466]

Thanks for this amazing video..God bless you

[@utsavseth6573]

Lovely Work Raj.

[@SudhanshuPanthri]

Brilliantly Explained Bhaiya.

[@ABCDEFGH-fz5ju]

His actions while explaining problems are just killer😎

[@kavyabanka4482]

Thanks for this amazing video

[@sukhpreetsingh5200]

As usual awesome ❤

[@user-fn1lx2gv9j]

As the input array is already sorted, we can use binary search to find the single element in the array. public int singleNonDuplicate(int[] nums) { int low = 0; int high = nums.length - 1; int mid; while (low < high) { mid = (low + high) / 2; if (mid % 2 != 0) { mid -= 1; } if (nums[mid] == nums[mid + 1]) { low = mid + 2; } else { high = mid; } } return nums[low]; }

[@konankikeerthi]

Thank you bro. i got clear understanding. i understood it very well

[@vishal_s583]

Great work ❤️

[@shanmugapriya6735]

You are my lifesaver thank you so much sir

[@praveentiwari629]

AWESOME EXPLANATION

[@suheabkhan2546]

Loved the content

[@bitlegion1027]

understood bhaiyaaa thankyou for the great explaination

[@aliakbaransaria3-925]

Very good explanation

[@shivangisirohi6032]

great explanation sir

[@monimoni6760]

Hi Striver, Thanks for your effort.When will you be covering strings and Heap.I am not able to see any video related to that topic in your channel.

[@rohitprasad5708]

Bro can you please take some time out from your busy schedule and upload a detailed video on Java collection framework, and can you please let us know what all core skills required for being a Java developer apart from DSA. Thanks

[@aadeshputhran7642]

You can watch this detailed Java collections tutorial: kzbin.info/www/bejne/jHbCcnSLrbmIebs&ab_channel=RiddhiDutta

[@DeveloperRB]

Great stuff ❤❤

[@gouravupadhyay9092]

Understood, thankyou bhaiya

[@shorts_shots514]

understood !!! thank you

[@hareshnayak7302]

Understood, thanks striver.

[@Mythri333]

Thank you so much 😊

[@Ramsiya658]

Understood striver much love to you

[@rish7394]

Bhaiya kasam se din se so rkha tha🥲, abhi socha kya kru notification aagya thanks.

[@DevashishJose]

Understood, Thank you

[@sarangkumarsingh7901]

Awesome Sir.............

[@shreyanshsharma7906]

understood thanks raj bhai

[@sohamchikane6591]

gaining confidence day by day one question though when should we revise? any suggestions would be appreciated.

[@peddikarthik7832]

one slight correction at 17:23 : xor can exceed largest number.(ie when number n%4==2)

[@_hulk748]

Understood sir❤🙇‍♂️🙏

[@Hipfire786]

understood everything sir

[@fallenAngel-cw9ki]

understood, ty!!

[@khushil9988]

understood and yes we need the video

[@themusicguy539]

Hello sir Thankyou for your efforts I have a question sometimes I make the approach of a question but not able to code it...maybe lack of doing questions by myself But just when I was doing questions of binary search of rotated sorted array of your DSA sheet...I am neither able to make approach nor code it....any guidance... (4th semester student)

[@winter_hope_]

Love you sir understood

[@Raj10185]

Understood everything Striver :)

[@faysalmahmud2721]

best explaination

[@foreverabel7680]

understood sir 🙌

[@prachyotbalijapelly1881]

god without temple❤❤❤

[@swagcoder]

God who made KZbin a Temple ❤

[@divyaagarwal3563]

UNDERSTOOD!

[@ajaywankhade5054]

Thank you

[@Miracle_shaw]

thank you

[@sahilranjan324]

Bhaiyaa Thanks 😊👍

[@yashwanthbm7543]

THANKS BRO

[@ankushladani496]

Understood More videos....🎉

[@AsharMallick750]

Thanks striver bro

[@indroneelgoswami5654]

UNDERSTOOD!!

[@user-gl8mv6dg4t]

maza aa gaya .❤

[@AniketSingh-gm9nh]

understood bhaiyaa🙂

[@lifehustlers164]

Completed 3/28!!!

[@user-tk2vg5jt3l]

Thank you Bhaiya

[@Sanjana-gp3gn]

Understood bhaiya ❤

[@mehrasmotivation6970]

Thank you bhaiya SDE sheet ke questions karane ke liye

[@RaviKumar-sn6tu]

sir you have my heart 😇

[@karnifex7606]

missing number with one variable(more simplified) int res = N; for(int i=0; i

[@ROCKY-tq1we]

For the missing number problem we can use index to compare the elements: for ( int i = 0 ; i < n ; i++) { if ( arr[i] ! = i+1 ) { return i; } }

[@dbhanuprakash515]

This will not applicable if array is not in sorted order ❤

[@chennupalliharish7126]

just use sum of n natural numbers formula and take all the sum into a varaible .Subtract each element from sum with all the array element and return the end sum

[@prafulsharma462]

I don't get why he is iterating 1st for loop in missing number From 0 to =n it will give an exception If some one know pls tell One more thing In 2nd loop why 0 to n-1

[@aakash_jamadar939]

It won't work. take A=[1,1,2,2,3] and check

[@aakash_jamadar939]

@@prafulsharma462 we don't do arr[i] for first loop,we use only numbers(i) in this loop.so we used range of numbers present in the array(i,e 1 to n). for 2nd loop,we need arr[j],so we use 0 to

[@heyOrca2711]

Understood sir!

[@NIRI0242]

If you ever feel so broken dont ever forget you re golden, i will find the light in you.❤❤❤

[@s_sattu_s]

Here's my most optimal code for the last question using XOR : class Solution { public: int singleNumber(vector& nums) { int ans = 0; for(int i=0; i

[@khalasianiket816]

understood ❤

[@vipinpathak8373]

understood!!

[@harishthoie5861]

understood brother

[@rijudey8008]

understood❤

[@jashanuppal9678]

@takeUfoward I had one doubt, in missing number like what if the the last number is missing then the XOR logic will not work because it nums.size will itself be 1 less already so it will not work that case?

[@per.seus._]

understood💯❤

[@YourCodeVerse]

Understood✅🔥🔥

[@aadeshputhran7642]

For the number that appears once problem, if the input array is sorted, I think the optimal time complexity will be O(log n) using binary search.

[@takeUforward]

Yes if it is sorted, here it was not

[@user-ll9py8pq2u]

how can i solve this question using binary search

[@jaydeeppatil7936]

@@user-ll9py8pq2u did you manage to solve it using binary search