Can you please give a summary for this and also some variations problems of this types
Cant figure out it for sorted array
The question requires us to binary search on a sorted array.
Whenever binary search comes into the picture, we think of dividing an array in half and choose to proceed only with one half. You just need to brainstorm, which part to proceed with.
you can try https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
My personal favorite variation of these type of problems is https://leetcode.com/problems/find-peak-element/
Do give it a try as well.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.