Why Find Peak Element Using Binary Search in DSA Python?

The Big Idea

What if you could find the tallest mountain without climbing every peak?

The Scenario

Imagine you have a long list of numbers representing mountain heights along a trail. You want to find a peak, a mountain taller than its neighbors. Checking each mountain one by one would take a lot of time, especially if the trail is very long.

The Problem

Manually checking each mountain means walking the entire trail, comparing each mountain with its neighbors. This is slow and tiring. If the trail is very long, it can take a lot of time and effort. Also, it's easy to make mistakes or miss a peak.

The Solution

Using binary search, you can quickly jump to the middle of the trail and decide which half to explore next based on the heights. This way, you skip large parts of the trail and find a peak much faster without checking every mountain.

Before vs After

✗ Before

for i in range(1, len(nums)-1):
    if nums[i] > nums[i-1] and nums[i] > nums[i+1]:
        return i
return 0 if nums[0] > nums[1] else len(nums)-1

✓ After

left, right = 0, len(nums) - 1
while left < right:
    mid = (left + right) // 2
    if nums[mid] > nums[mid + 1]:
        right = mid
    else:
        left = mid + 1
return left

What It Enables

This method lets you find a peak element in a list very quickly, even if the list is huge.

Real Life Example

Finding a peak is like quickly spotting the tallest building in a city skyline without looking at every building, saving time and effort.

Key Takeaways

Manually checking each element is slow and error-prone.

Binary search jumps smartly to find a peak faster.

This approach works well even for very large lists.

Practice

1. What is a peak element in an array when using binary search to find it?

easy

A. The first element of the array

B. An element that is greater than its neighbors

C. The smallest element in the array

D. An element equal to its neighbors

Solution

1. Step 1: Understand the definition of a peak element

   A peak element is one that is strictly greater than its neighbors on both sides (or just one side if at the boundary).

2. Step 2: Relate to binary search goal

   Binary search finds such an element by comparing middle elements with neighbors to decide search direction.

3. Final Answer:

   An element that is greater than its neighbors -> Option B

4. Quick Check:

   Peak element = greater than neighbors [OK]

Hint: Peak element is bigger than neighbors, not smallest [OK]

Common Mistakes:

• Thinking peak is smallest element
• Confusing peak with first or last element always
• Assuming peak equals neighbors

2. Which of the following is the correct Python syntax to start a binary search loop for finding a peak element in array nums?

easy

A. while left <= right:

B. for i in nums:

C. if left < right:

D. while left < right:

Solution

1. Step 1: Identify binary search loop condition

   Binary search typically uses while left < right: to narrow down the search space until left meets right.

2. Step 2: Compare options

   while left <= right: is common in classic binary search but for peak finding, while left < right: is preferred to avoid infinite loops.

3. Final Answer:

   while left < right: -> Option D

4. Quick Check:

   Binary search loop uses < not <= [OK]

Hint: Use while left < right for peak element binary search [OK]

Common Mistakes:

• Using for loop instead of while
• Using <= which may cause infinite loop
• Using if instead of loop

3. What will be the output index of the peak element for the array nums = [1, 3, 20, 4, 1, 0] using binary search peak finding?

medium

A. 2

B. 1

C. 3

D. 0

Solution

1. Step 1: Identify peak candidates

   Check elements: 20 at index 2 is greater than neighbors 3 and 4, so index 2 is a peak.

2. Step 2: Binary search logic

   Binary search will find index 2 by comparing mid elements and moving left or right accordingly.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   Peak at index 2 with value 20 [OK]

Hint: Peak is local max, here 20 at index 2 [OK]

Common Mistakes:

• Choosing first or last element incorrectly
• Confusing index with value
• Not checking both neighbors

4. Given this code snippet to find a peak element, what is the error?

def find_peak(nums):
    left, right = 0, len(nums) - 1
    while left <= right:
        mid = (left + right) // 2
        if nums[mid] < nums[mid + 1]:
            left = mid + 1
        else:
            right = mid - 1
    return left

medium

A. Index mid + 1 may cause out of range error

B. Return should be right instead of left

C. Loop condition should be while left < right

D. Mid calculation is incorrect

Solution

1. Step 1: Check index usage in condition

   The code accesses nums[mid + 1] without checking if mid + 1 is within array bounds.

2. Step 2: Identify potential error

   If mid is at the last index, mid + 1 causes an out of range error.

3. Final Answer:

   Index mid + 1 may cause out of range error -> Option A

4. Quick Check:

   Accessing nums[mid + 1] risks out of range [OK]

Hint: Check array bounds before accessing mid+1 [OK]

Common Mistakes:

• Ignoring array boundary checks
• Using <= in loop causing infinite loop
• Returning wrong index

5. You have an array nums = [10, 20, 15, 2, 23, 90, 67]. Using binary search, which index will be returned as a peak element? Consider multiple peaks exist.

hard

A. 1

B. 4

C. 5

D. 6

Solution

1. Step 1: Identify all peak elements

   Peaks are at index 1 (20 > 10 and 15), index 5 (90 > 23 and 67).

2. Step 2: Understand binary search behavior

   Binary search may return any peak, but typically it finds the one in the middle or right side depending on comparisons.

3. Step 3: Trace binary search on given array

   Mid starts near center; since nums[mid] < nums[mid+1] at some point, search moves right, finally returning index 5.

4. Final Answer:

   5 -> Option C

5. Quick Check:

   Binary search finds peak at index 5 with value 90 [OK]

Hint: Binary search may return any peak; here index 5 is found [OK]

Common Mistakes:

• Assuming only first peak is returned
• Ignoring binary search direction logic
• Confusing index with value