Sort the pile of cards
Submissions: 818   Accuracy:

27.45%

  Difficulty: Easy   Marks: 2

We have N cards with each card numbered from 1 to N. All cards are randomly shuffled. We are allowed only operation moveCard(N) which moves the card with value N to the top of the pile. You are required to find out the minimum number of moveCard() operations required to sort the cards in increasing order.

Input:
The first line contains a positive integer T denoting the number of test cases. Each of the test case consists of 2 lines. The first line of each test case contains a single integer N. Next line contains space separated sequence of N integers.ā€‹

Output:
For each test case, print in new line the minimum number of operations required.ā€‹

Constraints:
1 <= T <= 102
1 <= N <=107 
1 <= A[i] <= Nā€‹

Example:
Input:

2
5
5 1 2 3 4
4
3 4 2 1

Output:
4
2

Explanation:

For 1st case:                    

5 1 2 3 4              //given sequence

4 5 1 2 3              //moveCard(4)

3 4 5 1 2              //moveCard(3)

2 3 4 5 1              //moveCard(2)

1 2 3 4 5              //moveCard(1)

Hence, minimum 4 operations are required.

For 2nd case:

3 4 2 1             //given sequence

2 3 4 1             //moveCard(2)

1 2 3 4             //moveCard(1)

Hence, minimum 2 operations are required.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sajal Agrawal
Author: sajalagrawal


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.