Binary Search pattern
Peak Index in a Mountain Array
An array rises strictly to a single peak and then falls strictly away from it. Return the index of that peak in O(log n) time. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 852
- Medium
- 2 approaches
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
Binary SearchLeetCode 852
Medium
From the first idea to the best one
- 01 Brute force · walk the slope O(n)O(1) space
- 02 Optimized · binary search O(log n)O(1) space
What you will learn
- How to read Peak Index in a Mountain Array and spot the binary search pattern in it
- Brute force · walk the slope: O(n) time, O(1) space
- Optimized · binary search: O(log n) time, O(1) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Binary Search
- Maximum Candies Allocated to K ChildrenLC 2226 · Medium
- Apple Harvest (Koko Eating Bananas)LC 875 · Medium
- Search in Rotated Sorted ArrayLC 33 · Medium
- Find Minimum in Rotated Sorted ArrayLC 153 · Medium
- Search a 2D MatrixLC 74 · Medium
- Split Array Largest SumLC 410 · Hard
- Kth Smallest in a Sorted MatrixLC 378 · Medium
- Minimum Shipping CapacityLC 1011 · Medium
See Peak Index in a Mountain Array run, step by step
Sign in and this page opens on the animation, with all 11 Binary Search problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.