Skip to content
#

algorithms-implemented

Here are 430 public repositories matching this topic...

adityaarakeri
adityaarakeri commented Oct 7, 2020

Description of the Problem

Find a Peak Element

A peak element is an element that is greater than its neighbors.
Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that nums[-1] = nums[n] = -∞.
Example 1:

Input: nums = 

Improve this page

Add a description, image, and links to the algorithms-implemented topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the algorithms-implemented topic, visit your repo's landing page and select "manage topics."

Learn more