Longest common subsequence

can’t we do memoization in recursive solution of this problem ???

yes, we can do this with memoization
do u need help with the code?

i have written the code and it works fine –
but i have to ask that apart from iteratively solving it is there any way to memoize in recursive code ???

okkk send me the code of memoizing in recursive code

see my 2nd reply, it is the memoized code for the question

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.