Array ( [0] => [1] => questions [2] => Arrays [3] => Standing-Star-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
* * * * * * * * * * * *
4
* * * * * * * * * * * * * * * * * * * *
5
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
Login to see Discussion
Note:- this problem can be solved by dividing it to two parts
first part prints the upper part of the problem
second part prints the lower part of the problem
Step-i)assign 1 to i
Step-ii) assign 1 to j
Step-iii) print * and space (" ")
Step-iv) increment j value by one
Step-v) repeat steps iii and iv till j is less than or equal to i
Step-vi) go to next line and increment i value by one
Step-vii) repeat steps ii to vi till i is less than or equal to N
( By now we are done with the upper part of the pattern)
Step-viii)assign N to i
Step-ix) assign to 1 to j
Step-x)print * and space (" ")
Step-xi)increment j by one value
Step-xii)repeat steps x and xi till j is less or equal to i
Step-xiii) go to new line and increment i value by one
Step-xiv)repeat steps ix to xiii till i is greater than or equal to i
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