Dynamic Programming :Question on shortest uncommon subsequence

#1

The question is this:

However, I could not understand the solution they gave on GekksForGeeks, can the TA please write a simple recursive solution first and then explain me the code written on GFG?

#2

Hi @girikgarg
its a very simple recursive soln given over gfg… try to dry run on sample test case… it will give u a better insight…

#3

I hope it is clear now??

#4

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.