Skip to content

© 2026 uByte

Pricing Help Privacy Terms

Find Peak Elementmedium

Problems

1.Two Sum
2.Valid Parentheses
3.Contains Duplicate
4.Best Time to Buy and Sell Stock
5.Reverse String
6.Climbing Stairs
7.Missing Number
8.Single Number
9.Move Zeroes
10.Is Palindrome String
11.First Unique Character in a String
12.Majority Element
13.Plus One
14.Fibonacci Number
15.Valid Anagram
16.Roman to Integer
17.Max Consecutive Ones
18.Power of Two
19.Reverse Words in a String
20.Remove Duplicates from Sorted Array

1–20 of 114

114 problems

← Back to list·All languages →

Find Peak Element

medium

A peak element is an element that is strictly greater than its neighbors. Given an integer array `nums`, find a peak element and return its index. If the array contains multiple peaks, return the index of any of them. You may imagine that `nums[-1] = nums[n] = -∞`. You must write an algorithm that runs in `O(log n)` time.

Examples

Example 1

Input: nums = [1,2,3,1]

Output: 2

nums[2] = 3 is a peak.

Example 2

Input: nums = [1,2,1,3,5,6,4]

Output: 5

nums[5] = 6 is a peak.

← Prev Next →

1

2

3

4

5

6

7

8

9

10

11

💻

Click Run to execute your code

Or Submit to run against all hidden test cases

Find Peak Element — C# Coding Problem

Difficulty: medium | Category: binary-search

Problem Description

A peak element is an element that is strictly greater than its neighbors. Given an integer array `nums`, find a peak element and return its index. If the array contains multiple peaks, return the index of any of them. You may imagine that `nums[-1] = nums[n] = -∞`. You must write an algorithm that runs in `O(log n)` time.

Examples

Example 1

Input: nums = [1,2,3,1]

Output: 2

Explanation: nums[2] = 3 is a peak.

Example 2

Input: nums = [1,2,1,3,5,6,4]

Output: 5

Explanation: nums[5] = 6 is a peak.

← Back to C# Problems · All Interview Prep Problems