Crazy Numbers Pattern Challenge

Ninja enjoys arranging numbers in a sequence. He plans to arrange them in 'N' rows such that:

The first row contains 1 number.

The second row contains 2 numbers.

The third row contains 3 numbers, and so on.

The numbers are placed in increasing order with an absolute difference of 1. Starting from 1 and continuing until 9, after which the sequence restarts from 1.

Input:

The first line contains 'T', representing the number of test cases. Each test case has a single integer 'N', indicating the number of rows.

Output:

For each test case, output the integers in the pattern for the next 'N' lines.

Example:

Input:

1 4

Output:

1 23 456 7891

Constraints:

1

Question

Crazy Numbers Pattern Challenge

Ninja enjoys arranging numbers in a sequence. He plans to arrange them in 'N' rows such that:

The first row contains 1 number.
The second row contains 2 numbers.
The third row contains 3 numbers, and so on.

The numbers are placed in increasing order with an absolute difference of 1. Starting from 1 and continuing until 9, after which the sequence restarts from 1.

Input:

The first line contains 'T', representing the number of test cases. 
Each test case has a single integer 'N', indicating the number of rows.

Output:

For each test case, output the integers in the pattern for the next 'N' lines.

Example:

Input:

1 
4

Output:

Constraints:

1 <= T <= 10
1 <= N <= 500

Note: The expected output is printed automatically; focus on implementing the function logic.

Accepted Answer

Arrange numbers in a sequence in 'N' rows with increasing order and repeating after 9.

Iterate through each test case and for each row, print numbers in increasing order with a loop.
Keep track of the current number to print and reset to 1 after reaching 9.
Handle formatting to align numbers correctly in each row.
Ensure to print the correct number of rows based on the input 'N'.

Accepted Answer

int N = 5;
int counter = 1;
for (int i = 1; i 9)
          counter = 1;
    }
    Console.WriteLine();
}

Here Time complexity TC=> O(N^2)
And SC => O(1)

Asked in Nagarro