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

92 votes180 views6 answers
While loops python
Python
0 vote177 views1 answer
How to slice few rows in pandas
Python
0 vote191 views1 answer
Discordpy make all inputs lowercase
Python
0 vote190 views1 answer
Tkinter how to update optionmenu contents
Python
0 vote175 views1 answer
Fibonacci sequence in python 2.7
Python
12 votes186 views5 answers
Is prime python
Python
16 votes176 views4 answers
How to add path to python in windows
Python
28 votes201 views2 answers
Python date add days
Python
25 votes193 views4 answers
Python is ascii
Python
0 vote222 views1 answer
How to order randomly in django orm
Python Django