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 vote303 views1 answer
Print 1to 10 number without using loop in python
Python
0 vote328 views1 answer
Importing cosine from scipy
Python
2 votes296 views1 answer
Print all keys having same value
Python
0 vote317 views1 answer
Extract bigrams python
Python
4 votes337 views5 answers
Current time python
Python
0 vote349 views2 answers
Selenium check if driver is open python
Python
0 vote312 views1 answer
String + string in python
Python
3 votes315 views1 answer
Python simple web app
Python
0 vote334 views1 answer
Delete add replace conttent from csv by using python
Python
2 votes330 views3 answers
Building a fibbanaci sequence in python
Python