Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3
ฝัง
- เผยแพร่เมื่อ 5 ส.ค. 2024
- 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)
![[ไฮไลต์] แบดมินตันชาย SHI Yu Qi (จีน) vs วิว กุลวุฒิ (ไทย) รอบ 8 คน | โอลิมปิก 2024](http://i.ytimg.com/vi/f7z7taforOM/mqdefault.jpg)
Let's march ahead, and create an unmatchable DSA course! ❤
Use the problem links in the description.
Find the number that appear once and other number twice : (Partially Accepted) needed binary search approach ?
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
@@Vijaykrishnan2000 binary search requires sorting and sorting takes O(nlogn)
so how it is more optimal ?
@@PHANTOMWORLD the given array is sorted. No need to sort it.
@@Vijaykrishnan2000 bro have you found soloution for this
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.
Agreed 💯
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.
Striver shouting top oof voice and these DSA problems are getting slightly one after the other in my head. Thanks Striver
are you planning to put Scaler Academy out of business.?? 😆😆
Bhai matt has itna daant bahar nikal jayega
Bruhhh they take training from him lamo
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 🙏🙏.
0:11 motivation 😅 required too
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!
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!
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.
we learn concept but forget again ,bcs there are lots of problems and concepts
Thank you for all your videos! You have no idea how much these are helping everyone out there!!
Understood everything, you are one of a kind Striver!
Corrected code for missing numbers:
class Solution {
public:
int missingNumber(vector& nums) {
for(int i = 1; i
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
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
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
nice
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.
@@rudrsharma4758 It is sorted array though.
Thanks mate this does work
Understood! Amazing explanation as always, thank you very much for your effort!!
Love your content striver keep blessing us with such amazing videos
Extraordinary way of teaching. I never thought I would be able to solve all these questions quickly. Thanks man
you are real hero for me.
best teacher
like done 😊
#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....
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.
Raj, Thanks a lot for This Amazing Video about C++ Arrays
Video - 3 Completed ✅
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 .
Thankyou striver for your hardwork to make me understand your efforts make me work hard
The video and material were awesome. thanks for your efforts.
Understood! Amazing Explanation!
Understood each concept brother we need this kind of video 🎉
Understood! You make my day again brother!
Understood, Thank you so much for the awesome content..
Super amazing videos and explanations.
Understood!! Loved the lecture.
amazing just loved it
so clear explanation 😍
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];
}
i doing this first time and but in my mind i directly hit optimal solution , thanks striver also ,and after complete some video its develop new thinking way to approach problems
understood bhaiya...we need more videoes in a week, and get well soon..
Thanks for this amazing video..God bless you
Thanks for the amazing content striver
His actions while explaining problems are just killer😎
Thank you bro. i got clear understanding. i understood it very well
You are my lifesaver thank you so much sir
Lovely Work Raj.
Brilliantly Explained Bhaiya.
Bhaiya kasam se din se so rkha tha🥲, abhi socha kya kru notification aagya thanks.
Thanks for this amazing video
understood bhaiyaaa thankyou for the great explaination
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.
Great work ❤️
As usual awesome ❤
AWESOME EXPLANATION
Loved the content
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
You can watch this detailed Java collections tutorial: th-cam.com/video/VE_AAUxTUCY/w-d-xo.html&ab_channel=RiddhiDutta
Very good explanation
great explanation sir
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)
@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?
Understood striver much love to you
gaining confidence day by day one question though when should we revise?
any suggestions would be appreciated.
Understood, thankyou bhaiya
Understood, thanks striver.
one slight correction at 17:23 : xor can exceed largest number.(ie when number n%4==2)
Awesome Sir.............
Great stuff ❤❤
understood
and yes we need the video
Understood, Thank you
Thank you so much 😊
understood !!! thank you
@26:50, why do you need a for loop to look for the largest element? the input array is already sorted so the last element will always be the largest no?
Understood everything Striver :)
understood thanks raj bhai
Understood sir❤🙇♂️🙏
Love you sir understood
best explaination
understood everything sir
Completed 3/28!!!
sir you have my heart
😇
UNDERSTOOD!
maza aa gaya .❤
understood sir 🙌
Understood
More videos....🎉
understood bhaiyaa🙂
If a sorted array is given, then why do i need a for loop to find the max element? Cant i just initialize maxelement = arr[n-1]?
understood, ty!!
Bro A small Doubt - In Finding The Number that appears once, you took the max element by using a Loop - TC - O( n ) & a hash iterator - TC- O(n) ,:- TC - O( 3n )
> Insted [ My Logic ]
- If Array is Always Sorted can we take array [ n-1] as MAX so tha t we do not need to iterate the Entire hashing we can iterate up to max value we can make it - TC - O( 2n ) & SC - O ( n )
Thank you
UNDERSTOOD!!
Whenever your heart is broken
Don't ever forget you're golden ❤✨
The happiness when you hear these lines at the end of each video >>>>>>>>>>>>>>>>>> ♾
If you ever feel so broken dont ever forget you re golden, i will find the light in you.❤❤❤
Understood bhaiya ❤
Bhaiyaa Thanks 😊👍
understood💯❤
For the last problem's hashing approach why iterate through the given array to check their occurrence in hash array when you can just iterate through the hash array to check if hash[ i ] == 1 or not and then return i?
thank you
missing number with one variable(more simplified)
int res = N;
for(int i=0; i
hey can i use the same logic to code in JAVASCRIPT? since i am doing DSA in JAVASCRIPT.
Understood sir!
Thank you Bhaiya
Sir which ide are you using ok please can you tell ????
Hi @takeUforward, 2 questions on Missing Number problem:
1- Does the Brute Force solution has to be same as yours? For instance, I thought of sorting the array first and then check each element with index+1, and as soon as we find the missing element we return with index+1. The TC of the overall algorithm will be 0(nlogn){for sorting} + 0(n){for traversing}
2- What if we can't think of any better solution and miss explaining that to an interviewer? For instance, in my case I could think of the above and summation of n natural numbers solutions only.
I hope you address the questions and reply, thank you 😊
THANKS BRO
Understood✅🔥🔥
1st optimal solution was really good and new for me 09:00