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

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

11 күн бұрын

Agreed 💯

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

@shubhamKumar-mb6he

3 ай бұрын

Bhai matt has itna daant bahar nikal jayega

@abhishekg2766

28 күн бұрын

Bruhhh they take training from him lamo

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 🙏🙏.

@alwayshemanthreddy

5 ай бұрын

0:11 motivation 😅 required too

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!

Understood everything, you are one of a kind Striver!

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

5 ай бұрын

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

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

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

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 😊

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

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

5 ай бұрын

nice

@rudrsharma4758

2 ай бұрын

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

2 ай бұрын

@@rudrsharma4758 It is sorted array though.

@akshitrajputhere

Ай бұрын

Thanks mate this does work

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

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.

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

Understood! You make my day again brother!

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

Super amazing videos and explanations.

amazing just loved it so clear explanation 😍

Understood each concept brother we need this kind of video 🎉

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

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

Understood!! Loved the lecture.

Thanks for the amazing content striver

Thanks for this amazing video..God bless you

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.

His actions while explaining problems are just killer😎

Brilliantly Explained Bhaiya.

Thanks for this amazing video

You are my lifesaver thank you so much sir

Lovely Work Raj.

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

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

understood bhaiyaaa thankyou for the great explaination

AWESOME EXPLANATION

Very good explanation

As usual awesome ❤

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

Great work ❤️

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)

Loved the content

great explanation sir

Understood, thankyou bhaiya

Understood, thanks striver.

Understood striver much love to you

Understood, Thank you

understood !!! thank you

Understood everything Striver :)

Thank you so much 😊

Great stuff ❤❤

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 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]; }

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

understood and yes we need the video

understood thanks raj bhai

Understood sir❤🙇‍♂️🙏

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

UNDERSTOOD!

hey can i use the same logic to code in JAVASCRIPT? since i am doing DSA in JAVASCRIPT.

understood, ty!!

Thank you

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

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: kzread.info/dash/bejne/iHmTo6OOqLe7c7w.html&ab_channel=RiddhiDutta

Sir which ide are you using ok please can you tell ????

best explaination

understood everything sir

Understood More videos....🎉

maza aa gaya .❤

Thank you Bhaiya

Understood sir!

understood sir 🙌

Understood bhaiya ❤

god without temple❤❤❤

@swagcoder

Ай бұрын

God who made KZread a Temple ❤

Completed 3/28!!!

THANKS BRO

understood💯❤

sir you have my heart 😇

Does any know how to declare a map with fixed size and with default value in c++.

Bhaiyaa Thanks 😊👍

@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?

thank you

@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?

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]?

Thank you bhaiya SDE sheet ke questions karane ke liye

UNDERSTOOD :))

Thanks striver bro

Understood😌.

understood ❤

understood brother

understood !!

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

7 ай бұрын

how can i solve this question using binary search

@jaydeeppatil7936

6 ай бұрын

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

Nice.

understood!

understood 😊😊