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 vote173 views2 answers
Convert python code to java using jython
Java
36 votes164 views4 answers
Java generate random integer in range
Java
0 vote181 views2 answers
Like in cypher query
Java
0 vote174 views1 answer
Nextint java
Java
1 vote163 views1 answer
Javadoc link to class
Java
2 votes237 views1 answer
Taking date as input in java
Java
45 votes183 views6 answers
Java string to char array
Java
3 votes163 views1 answer
Advantages of using Java
Java
4 votes203 views2 answers
Foreach loop java values hashmap
Java
0 vote210 views1 answer
Javafx line chaart duplicate series added
Java