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

2 votes129 views2 answers
Spigot run task later
Java
0 vote145 views1 answer
Add close button on right top corner of alert dialog box for android
Java
34 votes134 views2 answers
Queue.isempty java
Java
2 votes120 views1 answer
Get the first Monday of a month in Java
Java
1 vote173 views1 answer
Android recyclerview show hide item with animation with default animation
Java
3 votes132 views1 answer
How to get data from radio group in android
Java
0 vote144 views1 answer
Android get user defined device name programmatically
Java
0 vote147 views1 answer
Spring security auto login after register
Java
0 vote137 views1 answer
Governmental transparency
Java
0 vote143 views1 answer
ArrayList add at specific index
Java