Input: 'N' = 6
Output: 1 2 3 4 5 6
If 'N' = 6, The numbers from 1 to 6 are 1, 2, 3, 4, 5, 6.
Hence, the output will be 1 2 3 4 5 6.
The first line of the input contains an integer, 'T’, denoting the number of test cases.
The first and only line of each test case will contain a single integer ‘N’.
For each test case, print the integers from 1 to N separated by spaces.
Print a separate line for each test case.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^4
Time limit: 1 sec
Run a for loop from 1 to N and print each number.
The idea of this approach is to make a recursive function ‘print(i)’ which will print ‘i’ and it will stop when ‘i’ reaches ‘N + 1’.
Sorted Doubly Linked List to Balanced BST
Longest Substring with K-Repeating Characters
Expression Add Operators
Gray Code Transformation
Count of Subsequences with Given Sum