Find Minimum in Rotated Sorted Array ii | LeetCode 154 | C++, Java, Python3

preview_player
Показать описание

**** Best Books For Data Structures & Algorithms for Interviews:**********
*****************************************************************************

July LeetCoding Challenge | Problem 25 | Find Minimum in Rotated Sorted Array ii | 25 July,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Find Minimum in Rotated Sorted Array ii,
Find Minimum in Rotated Sorted Array ii c++,
Find Minimum in Rotated Sorted Array ii Java,
Find Minimum in Rotated Sorted Array ii python,
Find Minimum in Rotated Sorted Array ii solution,
154. Find Minimum in Rotated Sorted Array ii

#CodingInterview #LeetCode #JulyLeetCodingChallenge #Google #Amazon #RotatedSortedArray
Рекомендации по теме
Комментарии
Автор

I tried it for so long and even half of this video helped me solving the problem in 3 min 🥰🤩

subrintakarmakar
Автор

Brother, your explanations are beautiful and up to the point. Kepp up the great work.

dhruvpatel
Автор

sir it would have been better if u had taken examples for every scenario thx

sachinkore
Автор

Sir why are we returning nums[l] and why not nums[r], another question what will be the equations if comparison of nums[mid] is with nums[l]?

BHARTGUPTABEC
Автор

why r-- and not l++ in case 3 ie mid == right???

DeepakGupta-zzvf
Автор

for the second case where arr[mid]<arr[right] search space should be minimised to (left, mid-1).

ADITYAKUMARking
Автор

sir please solve this problem also => 1411. Number of Ways to Paint N × 3 Grid

siddharthsingh