leetcode

Random Problem

2 files changed, 16 insertions(+), 0 deletions(-)

diff --git a/ Problems/0852.cpp b/ Problems/0852.cpp

@@ -0,0 +1,15 @@

class Solution {

public:

int peakIndexInMountainArray(const vector<int> &arr) {

int low = 1, high = arr.size() - 2;

while (low <= high) {

int mid = low + (high - low) / 2;

if (arr[mid - 1] < arr[mid] && arr[mid] > arr[mid + 1]) return mid;

if (arr[mid - 1] < arr[mid])

low = mid + 1;

else

high = mid - 1;

}

return -1;

}

};

diff --git a/ README.md b/ README.md

@@ -366,6 +366,7 @@ for solving problems. | 0841 | Medium | [Keys and Rooms](Problems/0841.cpp) | | 0844 | Easy | [Backspace String Compare](Problems/0844.cpp) | | 0851 | Medium | [Loud and Rich](Problems/0851.cpp) |

| 0852 | Medium | [Peak Index in a Mountain Array](Problems/0852.cpp) |

| 0853 | Medium | [Car Fleet](Problems/0853.cpp) | | 0859 | Easy | [Buddy Strings](Problems/0859.cpp) | | 0863 | Medium | [All Nodes Distance K in Binary Tree](Problems/0863.cpp) |