How to stack trace the questions involving recursive call inside a loop

#1

how to stack trace the questions involving recursive call inside a loop
in this case, its two loops involved so about these also

#2

first of all it’s a 2-d dp so , calculating each cell of dp would take n * n in itself. But here, calculating the cell at i, j takes into account all the calculated cells also, that means, the complexity should be n ^ 4 according to me.

#3

I am not asking for the answer , I am asking for the in which I can handle these types of problem like be do to other recursion problems by making recursive tree,if you can provide me any link about that or something.

#4

I think you will learn this skill gradually by yourself as you solve more and more no. of problems.

#5

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.