Breaking News: Grepper is joining You.com. Read the official announcement!

mountain array leetcode

Prabhu Kiran Konda answered on January 12, 2022 Popularity 8/10 Helpfulness 2/10

answer mountain array leetcode

related mountain array leetcode

mountain array leetcode

Comment

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

Popularity 8/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: python

Link to this answer
Share Copy Link

Contributed on Jan 12 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

Closely Related Answers

mountain array leetcode

Comment

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;
    }
}

Popularity 8/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Jan 12 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

mountain array leetcode

Contents

More Related Answers

mountain array leetcode

Closely Related Answers

mountain array leetcode

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.