diff --git a/LeetCode/Find peak element b/LeetCode/Find peak element
new file mode 100644
index 0000000..6e64588
--- /dev/null
+++ b/LeetCode/Find peak element	
@@ -0,0 +1,33 @@
+A peak element is an element that is strictly greater than its neighbors.
+
+Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.
+
+You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array.
+
+You must write an algorithm that runs in O(log n) time.
+
+ 
+
+Example 1:
+
+Input: nums = [1,2,3,1]
+Output: 2
+Explanation: 3 is a peak element and your function should return the index number 2.
+
+
+class Solution {
+public:
+    int findPeakElement(vector<int>& nums) {
+        
+         int l = 0, r = nums.size() - 1, mid;
+        while (l < r) {
+            mid = (l + r) / 2;
+            if (nums[mid] < nums[mid + 1])
+                l = mid + 1;
+            else
+                r = mid;
+        }
+        return l;
+        
+    }
+};