Psuedo codes for the problems

#1

In the pattern problem, i have made the observation that for Kth row there are there are (2k-1)th colmns, increment of val upto when row is equal to coln and decrement after that but i am facing problem in finding its pseudo code

#2

Hey @Keyzer007 if you are talking about 1st question then it should be like this
image

#3

can’t figure it out, can you please elaborate in detail?

#4

Lets take value of n , suppose it to be 5
Now with every value of i, run a j loop for 2*i-1
So for i=1 we will print only one value in 1st row, i.e.,

1

for i=2 we will print 2 at starting and ending of row, and between it we will increment

232

for i=3, key value. we will print 3 at starting and ending of row, and between it we will increment and then decrement as you can see.

34543

for i=4. we will print 4 at starting and ending of row, and between it we will increment and then decrement as you can see.

4567654

for i=5. we will print 5 at starting and ending of row, and between it we will increment and then decrement as you can see.

567898765

#5

i got the solution for this problem, can you pls explain the problem for adding digits and swapping the nos ?

#6

You are asking algonfor swapping of two numbers ? By adding and subtracting?

#7

If yes then you can see it here
image

#8

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.

#9

Hey @Keyzer007
How can I help u ?

#10

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.