Problem of the day

Login

New update is available. Click here to update.

Back to home

Binary Search

0% completed

0% completed

0% completed

Problem

Submissions

Solution

New

Discuss

Suggest Edit

```
It is guaranteed that there exists only one peak element in the array.
```

```
1.Do not print anything, just return the value of peak element of the array.
2.The first element can be the peak element if and only if the array is non-increasing i.e. it will be a peak if its equal to second element.
3.The last element can be the peak element if and only if the array is non decreasing i.e. it will be a peak if it's equal to second last element.
4.Consider 0 based Indexing.
```

Detailed explanation ( Input/output format, Notes, Images )

```
The first line of each test case contains an integer ‘n’ denoting the number of elements in the given sequence.
The second line of each test case contains ‘n’ space-separated integers denoting the elements in the sequence.
```

```
Return a single integer denoting the peak element of the array
```

```
1 <= N <= 10^5
-10^9 <= arr[i] <= 10^9
Where ‘N’ denotes the number of elements in the sequence and arr[i] denotes the ‘i-th’ element of the sequence.
Time limit: 1 second
```

```
5
1 2 3 2 1
```

```
3
```

```
In the given array we can see that the peak element is 3 because the element to its left and right is 2 which is less than 3. If we take any other element lets say the element at index 1 which is 2 (0-based indexing) we see the element to its left is 1 which is less but the element to its right is 3 which is not less therefore 2 can not be a peak element of the array.
```

```
5
2 3 4 1 -4
```

```
4
```

Auto

Console

View hints

Seems like, you got stuck. Refer hints to get directions.

Change Theme

Full Screen Mode

Autocomplete is inactive

Solution submission not allowed

Reset Code