

For example Pattern for 'N' = 4 will be-
1234
123
12
1
The first line contains an integer 'T' which denotes the number of test cases or queries to be run.
The first line of each test case contains a single integer ‘N’ denoting the number of rows for which pattern needs to be printed.
The output of each test case will be 'N' strings denoting the pattern printed for the given ‘N’ number of rows.
Output for each test case will be printed on a separate line.
1 <=T <= 5
1 <= N <= 500
Where ‘T’ is the total number of test cases and ‘N’ is the given number of rows for which pattern needs to be printed.
Time limit: 1 sec
We can observe that there is an ‘N’ number of rows (where ‘N’ is the total number of rows to be printed). Each row exactly contains the ‘row’ number of columns (where ’row’ is the current row number). And for each row in each column ‘col’ gets printed (where ’col’ is the current column number).
Special Numbers
Minimum Operations To Make Array Equal
Ninja's Encryption
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Minimum Window Subsequence
Fizzbuzz Problem