Find Minimum in Rotated Sorted Array II & l | Leetcode 154 & 153 | Hindi

liked this video? Click here / @codebix1096
join our Facebook group :- / 258049468776636
problem :- leetcode.com/p...
code :- github.com/luc...

[@madhurishgupta1181]

What an explanation man, finally understood this question after watching 3 different videos.

[@codebix1096]

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@imshivendra]

@@codebix1096 Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@aymankhan7010]

excellent way of explanation, you made it so easy to understand the logic

[@MohitSingh-qq3pg]

I had half-understood this logic from other videos. You made me understand it so well. Thank you so much

[@saldanaswiz1291]

watched around 4-5 vids but wasnt able to understand. This vide ois truly amazing. Short, clean and to the point! 👍👍

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@pirtpalsingh8804]

I really appreciate your way of explaining. Thanks

[@codebix1096]

Glad it was helpful! Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@nikhilrajsoni4541]

Best explanation I have seen so far... suscribed sir!!!

[@RahulRaj-wf9tb]

The best explanation ever...keep putting more problems sir

[@sourabhsharma2511]

very well explanation sir

[@narendersinghpawar2012]

sir nice explaination but you missed an edge case , what if we rotate our array n times for example : 11 13 15 17 rotated n times then it is giving error coz it will return 17 not 11

[@samayharsh6027]

Ek number....aisahi kuch dhundh rha tha 😅

[@souravsarkarofficials]

Superb explanation sir ji❤❤

[@CodeAndCoffeeWithAnu]

Love your explanations. 🎉❤

[@viraldevmurari6724]

very nice explanation

[@Jordan-jn6co]

best one yet

[@shantanukumar4081]

Great explanation 👍👍👍

[@39_jatinjain4]

Nice explanation 🔥🔥

[@ayushisharma1381]

Thank you for making these videos... 🤘🏻✌🏻

[@codebix1096]

Glad you like them!

[@imshivendra]

@@codebix1096 Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@AmitSharma-wx1wj]

Very good explanation.. thanks a lot!

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@cs_kasar_rohit1635]

explanation is crystal clear.

[@shobhitkumar6820]

If we have to return index of pivot point then this will not work for cases like 1 1 1 1 1 1 1 1 1 2 1 1 1

[@saunaknandi1814]

No its correct

[@siddharthmehta4223]

bhai thank you too much.. Love from Usa

[@aviralsharma9260]

literallly, you are god man. thanks

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@RC8787]

Great explanation! Thank you

[@AbhishekKumar-zt8bm]

This solution doesn't satisfy all the cases.

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@amangautam1779]

@@imshivendra check while condition it should be while(left

[@imshivendra]

@@amangautam1779 Thanks

[@puneetarora4565]

Best Explanation, thanks

[@AnandKumar-kz3ls]

in your Rotated Array 2 approch its not log(N) lets say all the elements are equal then you will compare your e pointer with N/2 length of array which bascially equal to (N)

[@Tensor08]

WOAH The Explanation!!!🙌🙌

[@zakky44A]

Amazing!

[@RanveerAllhabadia]

Op ! Like This Approach

[@ayushpatel125]

superb❤

[@aakashprajapati4836]

Great Explaination Bhaiya 👍👍

[@crackthecode1372]

sir whats the difference between (s+e)/2 and s+(e-s)/2

[@codebix1096]

medium.com/swlh/integer-overflow-in-java-98aaf4518a6

[@piyushsharma1040]

Amazing explanation 🙌🏻🔥

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@mahanteshambali]

@codebix whats the software you use for demonstration purposes.. like writing on the screen.

[@sharuk3545]

whattt a awesomeeee and easiest solution

[@mdrafehqureshi5409]

For the second question just add one more condition after initialising mid that is if(nums[mid]>nums[start]&& nums[mid]

[@akhilpadmanaban3242]

It will go upto O(n) in the worst case, if all are duplicate values,

[@devbhattacharya153]

Thanks a lot sir

[@ShivamKhantwal94]

Thanku bhai

[@aakash1763]

Thanks

[@MdAsif-eo9lm]

while submitting part 2, its showing wrong and..

[@codepage5391]

Sir, it's not able to pass all the Test-Cases in Leet-code. it does work ,,its only working for 69 test cases out-of 169...

[@ritwik121]

Nice explanation

[@rishichansauria3658]

You the best.... :)

[@dipbharatkumarpansuriya1876]

Amazing video

[@atharvdiwan1033]

Good

[@codebix1096]

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@Aman_Gupta54]

why did we decrease our end pointer and not increase the start pointer???

[@sachinvarma9949]

not working second ques in leetcode

[@RajputAnkit11]

Subscribed !!

[@testingDhippiuh]

Awesome

[@adityatiwari3743]

why are we doing e - - ; can anyone explain i understood the dry run but i m not able to understand the reason..

[@0anant0]

Here, the else is ar[s] == ar[m] OR ar[m] == ar[e] Thus, neither part is not asc sorted. i.e. all numbers are the same in both halves, but both halves may not have the same value, so just decrease the problem domain by one size and re-apply the logic

[@mayankarora9546]

TIME LIMIT EXCEEDED!!!

[@Shivanand-79]

Example : 11,12,13,14 ( 0 times rotated) First code Failed in this example

[@AryanSingh-ob7pm]

problem link might be wrong, please check!

[@codebix1096]

Yes thanks for letting me know

[@mishra1576]

R=mid ?? Please help me out of this..

[@vishalthakur2545]

🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥

[@AmanKumar-hx7pd]

Not passing all the test cases on leetcode, stop explaining half test case passed code.

[@pratik.784]

Agar minimum 5 baar hota to ?

[@rohitkandari7765]

bro i always get confused when to put equal condition like for while(low

[@saldanaswiz1291]

main point of the question is to get low=high, once we achieve that, it means we got our target. But if we use the (low

[@imshivendra]

Sir your explainition is too good but don't know why your code is giving Time limit Exceeded error in Leetcode

[@AmritAgarwal07]

Sir can you just creat WhatsApp aur Instagram or telegram where we can say about problem which we get in the company interviews and we can't able to do it

[@iuashrafi]

great explanation ; thanks a lot