InterviewBit Academy is now Scaler!
InterviewBit Academy is now Scaler Academy!

Perfect Peak of Array

Problem Description

Given an integer array A of size N.

You need to check that whether there exist a element which is strictly greater than all the elements on left of it and strictly smaller than all the elements on right of it.

If it exists return 1 else return 0.

NOTE:

  • Do not consider the corner elements i.e A[0] and A[N-1] as the answer.


  • Problem Constraints

    3 <= N <= 105

    1 <= A[i] <= 109



    Input Format

    First and only argument is an integer array A containing N integers.



    Output Format

    Return 1 if there exist a element that is strictly greater than all the elements on left of it and strictly smaller than all the elements on right of it else return 0.



    Example Input

    Input 1:

     A = [5, 1, 4, 3, 6, 8, 10, 7, 9]
    

    Input 2:

     A = [5, 1, 4, 4]
    



    Example Output

    Output 1:

     1
    

    Output 2:

     0
    



    Example Explanation

    Explanation 1:

     A[4] = 6 is the element we are looking for.
     All elements on left of A[4] are smaller than it and all elements on right are greater.
    

    Explanation 2:

     No such element exits.
    



    NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
    Start solving Perfect Peak of Array on Interview Code Editor
    Sign Up
    to access hints and editorial solutions for Perfect Peak of Array

    Discussion


    Loading...
    Click here to start solving coding interview questions