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 vote288 views2 answers
Create a recursive function to calculate the greatest common divisor in java
Java
0 vote330 views1 answer
Enum to string java
Java
0 vote315 views1 answer
Get whatsapp group id flutter
Java
15 votes339 views1 answer
Java random w3
Java
-2 votes316 views1 answer
Convert string to mayus java
Java
2 votes340 views1 answer
Instantiate optinal java 8
Java
0 vote323 views1 answer
Android java string animations
Java
0 vote320 views2 answers
Get first entry in set java
Java
0 vote328 views1 answer
Replace substring at index java
Java
0 vote363 views1 answer
Java remove non numbers from string
Java