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 vote183 views2 answers
What is operator overloading in java
Java
11 votes187 views2 answers
Java sleep in code
Java
-1 vote173 views1 answer
$950 at 6% per annum for three years.
Java
0 vote156 views1 answer
Captilize the first letter of the string
Java
0 vote173 views3 answers
What city is 94609
Java
0 vote169 views1 answer
Java code to launch shell script with arguments
Java
0 vote148 views1 answer
Rotate array to left k cells python
Java
11 votes178 views4 answers
How to read a text file in java
Java
0 vote184 views1 answer
How to make a ordering system in microsoft visual basic 2010 express console application
Java
0 vote155 views1 answer
Java to check if its a number scanner
Java