Problem title
Difficulty
Avg time to solve

Number Pattern
Easy
15 mins
Find rank
Easy
15 mins
Maximum 1s
Easy
10 mins
Maximum Sum Of (i * ARR[i]) Among All Possible Rotations Of An Array
Moderate
15 mins
Star Pattern
Easy
10 mins
Number Pattern
Easy
15 mins
Game of Numbers
Easy
20 mins
Find Character Case
Easy
9 mins
Power of Two
Easy
15 mins
Count Leaf Nodes
Easy
10 mins
7

Number Pattern

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

Problem Statement

Ninja wants to build a number pattern.

Example For ‘N’ = 4 

Pattern:

4444
3444
2344
1234

Your task is to make a program that prints a similar pattern for a given 'N'.

Input Format:
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 one integer, ‘N’, denoting the number of rows.
Output Format:
For each test case print, 'N' strings denoting the pattern.

The output of each test case will be printed on a separate line.
Note:
You do not need to input or print anything, as it has already been taken care of. Just implement the given function.
Constraints:
1 <= T <= 5
1 <= N <= 200

Time Limit: 1 sec
Sample Input 1:
2
5
2
Sample Output 1:
55555
45555
34555
23455
12345
22
12
Explanation of Sample Input 1:
Test case 1:

In the first test case, as ‘N’ is equal to ‘5’, We will have to print five lines. We have a print a square-like pattern where the upper right triangle along with the main diagonal will be filled with the input number and the lower-left triangle will be a triangle wherein each row, number of elements increases from ‘1’ to ‘N’ - 1;

Test case 2:

In the second test case, as ‘N’ is equal to ‘2’, We will have to print two lines.
Sample Input 2:
2
1
4
Sample Output 2:
1
4444
3444
2344
1234
Explanation of Sample Input 2:
Test case 1:
As ‘N’ is equal to ‘1’, we just need to print one line i.e 1. 
Reset Code
Full screen
copy-code
Console