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 votes189 views1 answer
Declaration of list in java
Java
0 vote156 views1 answer
Multiplication program java
Java
0 vote191 views2 answers
Android studio clear child views
Java
0 vote175 views1 answer
Java equals on recursive apache commons
Java
0 vote157 views1 answer
Android diagonal gradle
Java
1 vote224 views1 answer
FeignException byteBuffer to string
Java
22 votes176 views4 answers
Iterate through an arraylist java
Java
-1 vote157 views1 answer
Java in 5 minutes
Java
0 vote179 views1 answer
Problem solving using recursion in java
Java
3 votes177 views2 answers
Java hashmap time complexity
Java