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

103 votes309 views6 answers
Java hello world program
Java
2 votes153 views1 answer
Primefaces calendar min date validation
Java
3 votes181 views1 answer
Copy arraylist java
Java
0 vote184 views3 answers
Bundletool aab to apk
Java
0 vote208 views1 answer
How to change fragment on button click navigation drawer
Java
4 votes222 views3 answers
Creating a 2d arraylist in java
Java
1 vote176 views1 answer
How to register event spiot
Java
12 votes178 views3 answers
Start activity intent
Java
65 votes197 views6 answers
Java last element of array
Java
0 vote184 views1 answer
How to get individual words from a string in java
Java