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

0 vote212 views1 answer
In java write a code that suppose the following input is supplied to the program: 9 Then, the output should be: 12096 (99+999+9999+999)
Java
0 vote200 views1 answer
Transparent border of jtextfield in java
Java
0 vote205 views1 answer
Site:stackoverflow.com List is abstract; cannot be instantiated public List<Integer> result = new List<>();
Java
0 vote189 views1 answer
File with line numbers inserted java
Java
0 vote188 views1 answer
If ternaire java
Java
1 vote198 views1 answer
Java split string on two or more spaces except for words in quotes
Java
0 vote198 views7 answers
Convert code python to java
Java
1 vote208 views1 answer
Load a file from classpath spring boot
Java
0 vote201 views1 answer
Get all colors in string spigot
Java
1 vote202 views1 answer
How to generate a random number in libgdx
Java