Mountain array leetcode

class Solution:
    def peakIndexInMountainArray(self, arr: List[int]) -> int:
        start = 0
        end = len(arr)-1
        
        while (start < end):
            mid = start + (end-start)//2
            if (arr[mid]>arr[mid+1]):
                end = mid
            else: start = mid+1
        return start

Mountain array leetcode

class Solution {    
    public static int peakIndexInMountainArray(int[] arr) {
        int start = 0;
        int end = arr.length-1;

        while(start < end){
            int mid = start + (end-start)/2;

            if (arr[mid] > arr[mid+1]) end = mid;
            else start = mid+1;
        }
        return start;
    }
}

Similar codes

0 vote273 views2 answers
Python code for fibonacci
Python
1 vote267 views1 answer
Flask form errors
Python
3 votes271 views1 answer
Chech box in tkinter
Python
0 vote328 views1 answer
How to insert value in admin panel in django
Python Django
2 votes282 views1 answer
Use of the word bruh over time
Python
2 votes273 views3 answers
Miles to km in python
Python
0 vote269 views1 answer
Python select from list by condition
Python
7 votes276 views3 answers
Python selenium click element
Python
0 vote293 views2 answers
Python function overloading
Python
0 vote272 views1 answer
Delete history django simple
Python