How to proceed for this problem?
Appraach for this problem
@hrikroy201001001129_f42fcea8aec035de
In Pattern Question, there is a common method which we teach in course viz, taking nsp, nst, csp, cst and row variables.
Pattern Hack : Always first Try to first print pattern by ignoring the value to be printed then accommodate your value in that pattern. For e.g.,
1
2 1 1 2
3 2 1 1 2 3
4 3 2 1 1 2 3 4
3 2 1 1 2 3
2 1 1 2
1
View it as:-
*
* * * *
* * * * * *
* * * * * * * *
* * * * * *
* * * *
*
Short Info about the variables:-
1. nsp (number of spaces)-> Number of spaces in very First Line of the pattern.
2. nst (number of stars)-> Number of stars in very first line of the pattern.
3. csp (counter of spaces)-> counter of spaces that will print the required number of spaces and will be initialized with 1 and incremented upto nsp.
4. cst (counter of stars)-> counter of spaces that will print the required number of stars and will be initialized with 1 and incremented upto nst.
5. rows -> It will be initialized with 1 and will go upto the total number of rows in the pattern.
–Input N is the number of rows.Given pattern is seen as first spaces ,then numbers ,then spaces and then numbers again. Till middle row, number of numbers in one batch in a row is equal to row number. After middle row, number of numbers decreases each time by 1.The max value in the pattern is in the middle row which is (N/2 +1).
–So do the work of spaces first ,then that of numbers in decreasing order, then that of spaces and then that of numbers in increasing order.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.