# Find peak element in the array

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs.

In this post, we will see how to find peak element in the array.

## Problem

Given an array of integers. find the peak element in the array.
` Peak Element` is the element of the array which is `GREATER THAN / EQUAL` TO its neighbours, that is, for an element at `i` th index, the neighbour elements at index `i-1` & `i+1` must be greater than equal to element at `i` th position.
Now

An array can have several peak elements, we need to output any one of them.

## Solution

The basic approach to this problem would be iterate through the whole array and at every i th element check the condition `arr[i-1] = arr[i+1]`.

• For an array with equal numbers, every element will be peak element.
• For corner elements the conditions gets slightly tweaked as they will have only one neighbour, that is,
for extreme left element we just need to check if `arr[i+1] <= arr[i]`.
for extreme right element we just need to check `arr[i-1] <= arr[i]`.
• The worst time complexity of this approach would be `O(n)`.

Efficient Approach:

We can use a Divide and conquer approach for the same which uses an algorithm similar to Binary search where a condition is checked with the middle element and depending on the result we search for our answer in one of the halves of the initial array. As the number of elements gets half on every call, this will have the worst time complexity of O(log(n)).

Algorithm :
We compare middle element of the array with its neighbours and if it is greater than or equal to its neighbours. If the middle element is greater than or equal to its neighbours, we return it.
If the element is smaller than its left neighbour then it is sure that the peak element lies in left.

WHY?

Consider an Array,

`int[] arr = {a1, a2, a3, a4, a5, a6, a7};`
There arise 2 cases when left neighbour`(a3)` is greater than middle element`(a4)` i.e. `a3 > a4`:
Case-1 : if the left neighbour`(a3)` is corner, then this is our peak element.
Case-2 : if left element is not the corner element.Here again 2 possibilities arise, that is,

1. if `a2 > a3` , then this becomes the same recursive subproblem which we discussed
above and its result will eventually be calculated recursively.
2. if `a2 < a3`, then again `a3` is our peak element because, `a3 > a2`  &  `a3 > a4`, i.e. `a3` is greater than or equal to its neighbours.

The same procedure is followed the case when right neighbour (a5) is greater than middle element.

When you run above program, you will get below output.

4 10 20 40 15
arr[]: { 10 20 40 15 }
Peak element is : 40 found at index 2

That’s all about how to find peak element in the array.
Comment in case of any doubt or edit. Happy Learning 🙂

import_contacts

## Related Posts

• 04 June

### Search for a range Leetcode – Find first and last position of element in sorted array

Table of ContentsApproach 1 (Using Linear Search)Approach 2 (Using Modified Binary Search-Optimal) In this article, we will look into an interesting problem asked in Coding Interviews related to Searching Algorithms. The problem is: Given a Sorted Array, we need to find the first and last position of an element in Sorted array. This problem is […]

• 28 March

### Sort an array of 0s, 1s and 2s

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to sort an array of 0s, 1s and 2s.We have already seen a post on sort 0s and 1s in an array. Problem Given an array containing zeroes, […]

• 04 March

### Check if it is possible to reach end of given Array by Jumping

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. ﻿ ﻿ Problem Given an array with positive integers as elements indicating the maximum length of a jump which can be made from any position in the array. Check if it is possible to have […]

• 17 February

### Check if Array Elements are Consecutive

Table of ContentsProblemSolutionProgram to check if Array Elements are Consecutive If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to check if array elements are consecutive. Problem Given an array, we need to check if array contains […]

• 01 November

### Find the local minima in array

Table of ContentsProblemSolutionNaive approachEfficient approach If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to find the local minima in the array. Problem An element is local minima if it is less than its neighbors. int [] arr = {10, […]

• 22 October

### Sliding Window Maximum in java

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see about Sliding Window Maximum in java Problem Given an Array of integers and an Integer k, Find the maximum element of from all the contiguous subarrays of size K. […]

## Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.