What would be the best approach for this problem without using dynamic programming?
What is the best approach for this problem
@tusharnitharwal
Hello tushar,
there is recursive approach for this problem but its complexity is high so we improve its time complexity by using dynamic programming.
In my knowledge dp approach is the best approach(in terms of time complexity) for this problem
I want to know the recursive approach only
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.