Perfect Peak of Array

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:

3 <= N <= 10⁵

1 <= A[i] <= 10⁹

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

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.

Input 1:

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

Input 2:

 A = [5, 1, 4, 4]

Output 1:

 1

Output 2:

 0

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.