Algorithm

A peak element in an array refers to the element that is greater than both of its neighbors. Basically, if arr[i] is the peak element, arr[i] > arr[i-1] and arr[i] > arr[i+1].

Now if we want to visualize an array with the peak elements from the graphical point of view, there can be 4 cases:

Case 1: An array with a single peak number:

Case 2: An array with multiple peaks:

Case 3: Last element as peak element:

Case 4: First element as peak element:

The brute force approach to find peak element is to traverse the entire array and compare the current element with both of its neighbours. If it is greater than both of its neighbours we can simply return it as our peak element.

For the elements at first and last index, since both the neighbours are not available, we can just check their only neighbour element and return if its a peak element or not.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find a peak element in the array
    int findPeakElement(vector<int>& nums) {
        int n = nums.size();
       