Peak Element | GeeksforGeeks GFG Solution in C++ | Linear Scan Approach | DSA

Today I solved the Peak Element problem from GeeksforGeeks using a linear traversal approach in C++.

📊 Difficulty: Medium
🎯 Accuracy: 38.86%
📈 Submissions: 624K+
⭐ Points: 4

🔗 Problem Link:
https://www.geeksforgeeks.org/problems/peak-element/1?sortBy=submissions&category%255B%255D=Arrays&page=1&difficulty%255B%255D=0

📌 Problem Statement

You are given an array where no two adjacent elements are the same.
Your task is to find the index of a peak element.

An element is considered a peak if it is greater than its adjacent elements.

👉 If there are multiple peak elements, you can return any one of them.

📌 Note:
The element before the first element and the element after the last element are considered negative infinity.

📌 Example

Input array = 1, 2, 4, 5, 7, 8, 3

Output
true

📌 Approach Used in This Video

In this solution, we use a linear traversal approach.

Step 1
Traverse the array from index 1 to n-2 and check:

previous element is smaller than current element
AND
next element is smaller than current element

If this condition is true → return that index.

Step 2
If no peak is found in the middle:

Find the maximum element in the array.

Step 3
Check edge cases:

If the first element is the maximum and greater than the next element → return index 0

If the last element is the maximum and greater than the previous element → return last index.

📌 Complexity

Time Complexity: O(n)
Space Complexity: O(1)

📌 What You Will Learn

• How to detect peak elements in arrays
• Using array traversal with neighbor comparison
• Handling edge elements
• Implementing the solution in C++

🔖 Tags

#PeakElement
#FindPeakElement
#GeeksforGeeks
#GFG
#DSA
#Arrays
#CPlusPlus
#CPP
#CodingInterview
#InterviewPreparation
#CompetitiveProgramming
#ProblemSolving
#DSAWithCPP
#GFGSolutions

Видео Peak Element | GeeksforGeeks GFG Solution in C++ | Linear Scan Approach | DSA канала SCIENCE IN FRONT OF YOU