Recursion/ Divide and Conquer- Find peak element

[pri1311]

Is your feature request related to a problem? Please describe.
https://leetcode.com/problems/find-peak-element/
A peak element is an element that is strictly greater than its neighbors.

Given an 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.
Difficulty: medium

• A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]

Describe the solution you'd like

• A clear and concise description of what you want to happen.

Describe alternatives you've considered

• A clear and concise description of any alternative solutions or features you've considered.

Additional context

• Add any other context or screenshots about the feature request here.

[pri1311]

Please assign this to me under crosswoc for C++

[Akash20x]

I want to solve this in python

[abhinav5481]

Hi @ankitapuri
I would like to solve it in Java Script. Please assign it to me in Java