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

1 vote125 views1 answer
Convert rgb to a single value
Python
0 vote147 views1 answer
Validating credit card numbers
Python
84 votes357 views2 answers
Python with statement file does not exist exception
Python
4 votes150 views1 answer
Orderd set in python
Python
18 votes191 views3 answers
Export flask app
Python
0 vote151 views1 answer
Python elementtree load from string
Python
2 votes144 views1 answer
Download pdf from link using python
Python
0 vote144 views1 answer
Pandas to latex table newline not working
Python
0 vote139 views1 answer
Python download video from instagram
Python
1 vote106 views1 answer
Best live score api
Python