Cant figure this one out

#1

Can you please help with pattern , i cannot figure this out

#2

create a 2d matrix of size n * n and store 1 in first column. Now start iterating from second row and iterate columns till <=i and A[i][j] = A[i - 1][j] + A[i - 1][j + 1]. This way A is filled, then print only the lower half of A.

#3

can’t we do it without using arrays I mean in the simple way as we were doing all the patterns , without storing them?

#4

No you can’t because previous values determine the next values here, so you need a cache to store previous values

#5

I mean arrays have not been taught yet, so is it not like that we have to do this question without using arrays?

#6

Honestly, I don’t see any way out to do this question without any form of cache. And arrays is simplest among them all.

#7

understandable thanks