Added Solution for LeetCode Problem No. 162

Author: Pujari8691

LeetCode/162. Find Peak Element/Solution.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int findPeakElement(int[] arr) {
+         int start = 0;
+        int end = arr.length - 1;
+        while (start < end) {
+//             find the middle element
+            int mid = start + (end - start) / 2;
+            if (arr[mid] > arr[mid + 1]) {
+                end = mid;
+            } else if (arr[mid] < arr[mid + 1]) {
+                start = mid + 1;
+            }
+        }
+        return start;
+    }
+}