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

1 vote202 views2 answers
Python sizeof
Python
19 votes181 views3 answers
Pil image to numpy array
Python
26 votes192 views2 answers
Dictionary from two list
Python
99 votes208 views6 answers
Python delete file
Python
0 vote207 views1 answer
Python to C++ converter
Python
15 votes216 views2 answers
Loop throughthe key and the values of a dict in python
Python
0 vote189 views1 answer
Concatenar columnas en una del mismo dataset
Python
0 vote188 views1 answer
Pydub create empty track
Python
1 vote181 views1 answer
Code hand tracking
Python
8 votes187 views4 answers
How to reverse a dictionary in python
Python