Merge pull request neetcode-gh#2710 from tahzeer/patch-6

Create 0162-find-peak-element.cpp

Author: MHamiid

cpp/0162-find-peak-element.cpp

@@ -0,0 +1,27 @@
+// Time: O(logN)
+// Space: O(1)
+
+class Solution {
+public:
+    int findPeakElement(vector<int>& nums) {
+        int n = nums.size();
+
+        if(n == 1) return 0;
+
+        int left = 0, right = n - 1;
+        while(left <= right) {
+            int mid = left + (right-left)/2;
+
+            if(mid > 0 && nums[mid] < nums[mid-1]) {
+                right = mid - 1;
+            }
+            else if(mid < n-1 && nums[mid] < nums[mid+1]) {
+                left = mid + 1;
+            }
+            else {
+                return mid;
+            }
+        }
+        return -1;
+    }
+};