Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3
Vložit
- čas přidán 2. 07. 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)
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
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
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.
Striver shouting top oof voice and these DSA problems are getting slightly one after the other in my head. Thanks Striver
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!
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
Understood everything, you are one of a kind Striver!
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!!
Love your content striver keep blessing us with such amazing videos
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
Understood! Amazing explanation as always, thank you very much for your effort!!
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
you are real hero for me.
best teacher
like done 😊
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
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!
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.
Understood each concept brother we need this kind of video 🎉
Understood! You make my day again brother!
Raj, Thanks a lot for This Amazing Video about C++ Arrays
Video - 3 Completed ✅
amazing just loved it
so clear explanation 😍
Understood!! Loved the lecture.
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 .
Super amazing videos and explanations.
understood bhaiya...we need more videoes in a week, and get well soon..
Thanks for this amazing video..God bless you
Understood, Thank you so much for the awesome content..
Thanks for the amazing content striver
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];
}
His actions while explaining problems are just killer😎
Corrected code for missing numbers:
class Solution {
public:
int missingNumber(vector& nums) {
for(int i = 1; i
Brilliantly Explained Bhaiya.
Lovely Work Raj.
You are my lifesaver thank you so much sir
Thank you bro. i got clear understanding. i understood it very well
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.
Thanks for this amazing video
AWESOME EXPLANATION
understood bhaiyaaa thankyou for the great explaination
As usual awesome ❤
Very good explanation
one slight correction at 17:23 : xor can exceed largest number.(ie when number n%4==2)
Bhaiya kasam se din se so rkha tha🥲, abhi socha kya kru notification aagya thanks.
Great work ❤️
great explanation sir
Loved the content
gaining confidence day by day one question though when should we revise?
any suggestions would be appreciated.
Understood, thankyou bhaiya
Understood, thanks striver.
Understood striver much love to you
Understood, Thank you
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: czcams.com/video/VE_AAUxTUCY/video.html&ab_channel=RiddhiDutta
Thank you so much 😊
understood !!! thank you
Understood everything Striver :)
Awesome Sir.............
Great stuff ❤❤
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)
Understood sir❤🙇♂️🙏
understood thanks raj bhai
understood
and yes we need the video
UNDERSTOOD!
understood, ty!!
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.
Yes if it is sorted, here it was not
how can i solve this question using binary search
@@user-ll9py8pq2u did you manage to solve it using binary search
understood everything sir
@takeUforward at 16:40, I think even we are running the first statement in second loop to avoid the first loop still the complexity going to be O(2n) because we increase the no. of statement executing
that's not how it works
@@anshumann ohh I thought every line of code or every task takes one unit of time
best explaination
When I see question my mind works in finding directly the optimal solution after reading question 2 things came in my mind that I have to use no extra space like first try to solve it without extra space then in O(N) or in O(log n) possible
and after speeding some couple of minutes I directly finds the optimal solution
So I don't have idea about what will the brute force in this case or better
Understood
More videos....🎉
understood sir 🙌
Understood bhaiya ❤
sir you have my heart
😇
Completed 3/28!!!
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 >>>>>>>>>>>>>>>>>> ♾
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?
For the question find the number that appear once we can also use 2(n(n+1)/2 ) - sum of elements in array
Note : n is the maximum element in the given array
Because we know that all the other numbers are twice
Hope it is helpful 😊
And thank you striver for the awesome explanation
No, it won't work. If we consider the array 4,1,2,1,2, the answer should be 4, but if we follow your formula, the result is 10, which is incorrect.
@@KeepCoding69 this formula works only if the numbers are consecutive and in the question if they mention only consecutive numbers are given as input it will definitely works 🙂
@@KeepCoding69 try with consecutive numbers input like 3,1,2,1,2
missing number with one variable(more simplified)
int res = N;
for(int i=0; i
Bhaiyaa Thanks 😊👍
Thank you bhaiya SDE sheet ke questions karane ke liye
thank you
Can anyone explain Why use outer loop as i
the size of the array is N-1, and not N, as one number is missing, read the question
Understood✅🔥🔥
THANKS BRO
@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?
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 😊
1st optimal solution was really good and new for me 09:00
If the array range is [0,n] In Missing no problem for brute approach for loop should be this for(int i=0;i
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
Understood sir!
Thank you Bhaiya
Thanks striver bro
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;
}
}
This will not applicable if array is not in sorted order ❤
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
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
It won't work.
take A=[1,1,2,2,3] and check
@@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
Consistency 🔥🔥
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 )
Please solve for GFG question - " Given a binary array arr of size N and an integer M. Find the maximum number of consecutive 1's produced by flipping at most M 0's." whose link is given on ur website .
Please do solve GFG question links too as they r different from Code Studio ones .
bro that is the medium one it requires bit manipulation concept in gfg that why i left and done in the leetcode
Understood Sir