Array ( [0] => [1] => questions [2] => Basic [3] => Hallow-Triangle )
Print the pattern as shown below for all test cases.
First line contains the value N.
Print the output as shown in below examples.
3
1 1 2 1 2 3
4
1 1 1 1 3 1 2 3 4
5
1 1 2 1 3 1 4 1 2 3 4 5
Login to see Discussion
Step-i) assign 1 to i
Step-ii) initialize space to 1
Step-iii) print two spaces (" ")
Step-iv)increment space by one value
Step-v)repeat steps iii to iv till space is less than or equal to N-i
Step-vi)assign 1 to j
Step-vii)if j not equal to 1 and j is less than i print two spaces (" ")
Step-viii)else print j and space(" ")
Step-ix)increment j by one value
Step-x)repeat steps vii and ix till j is less than or equal to i
Step-xi)go to new line and increment i value by one
Step-xii)repeat steps ii to xi till i is less than or equal to N
Time Complexity: O(n^2)
Space Complexity: O(1)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution