Problem title
Difficulty
Avg time to solve

Ninja And Editor
Easy
20 mins
Encoded Letter
Moderate
25 mins
Tree Jumping
Hard
50 mins
Base Conversion
Easy
15 mins
Number of ones in the smallest repunit
Moderate
30 mins
Conversion
Easy
20 mins
Moderate
15 mins
Last Substring In Lexicographical Order
Hard
45 mins
Minimum And Maximum
Easy
15 mins
Rectangles In N x N Board
Moderate
20 mins

# Ninja In Interview

Difficulty: EASY
Contributed By
Avg. time to solve
15 min
Success Rate
85%

Problem Statement

#### Return 1 if the array is sorted, else return 0.

##### EXAMPLE:
``````Input: 'N' = 2, ‘ARR’ = [1, 2, 5, 6]

Output: 1

As we can see that ‘ARR’ is sorted in ascending order so the answer will be 1.
``````
##### Input Format :
``````The first line will contain the integer 'T', denoting the number of test cases.

For each test case, the first line will contain ‘N’ the number of elements in array ‘ARR’ and the next line will contain all the elements of ‘ARR’.
``````
##### Output format :
``````For each test case, print 1 of the array is sorted else print 0.
``````
##### Note :
``````You don't need to print anything. It has already been taken care of. Just implement the given function.
``````
##### Constraints :
``````1 <= 'T' <= 10
1 <= 'N' <= 10^3
1 <= ‘ARR[i]’ <= 10^9

Time Limit: 1 sec
``````
##### Sample Input 1 :
``````2
3
1 2 3
4
10 15 12 20
``````
##### Sample Output 1 :
``````1
0
``````
##### Explanation Of Sample Input 1 :
``````For the first case:
All the elements of the array are greater than or equal to the previous element of it except for the first element of the array as there is no element before it. Hence the answer will be 1.

For the second case:
At 2nd index (0-based indexing) we can see that 12 is not greater than 15 so the array is not sorted so the answer is 0.
``````
##### Sample Input 2 :
``````2
1
1
5
1 2 2 2 5
``````
##### Sample Output 2 :
``````1
1
``````
Console