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

21 votes222 views5 answers
Python exception
Python
6 votes231 views3 answers
Python console pause
Python
5 votes245 views3 answers
Python if not
Python
0 vote232 views1 answer
List all subdirectories up to a level
Python
0 vote244 views1 answer
Presto sequence example date
Python
0 vote222 views1 answer
Python how to locate and fill a specific column null values
Python
1 vote229 views1 answer
Kill turtle
Python
-1 vote249 views1 answer
How to sort columns alphabetically in pandas
Python
27 votes246 views4 answers
Python text color
Python
0 vote214 views1 answer
Grading system in python with nested if
Python