Find the Peaks

You are given a 0-indexed array mountain. Your task is to find all the peaks in the mountain array.

Return an array that consists of indices of peaks in the given array in any order*.*

Notes:

• A peak is defined as an element that is strictly greater than its neighboring elements.

• The first and last elements of the array are not a peak.

LeetCode Problem - 2951

class Solution {
    public List<Integer> findPeaks(int[] mountain) {
        // Initialize a list to store the indices of the peaks
        List<Integer> peak = new ArrayList<>();

        // Iterate through the mountain array starting from the second element to the second-to-last element
        for(int i = 1; i < mountain.length - 1; i++) {
            int currentPeak = mountain[i]; // Current element in the array

            // Check if the current element is greater than its neighbors (previous and next elements)
            if(currentPeak > mountain[i - 1] && currentPeak > mountain[i + 1]) {
                peak.add(i); // If true, add the index of the current element to the peak list
            }
        }

        // Return the list of peak indices
        return peak;
    }
}