Sir/Mam
One of the test case gives TLE and rest two are correct after using Recursive technique much similar to count board path, Now what to do ?
TLE in this code
pls try dp appraoch
the complexity of dp approach is O(n2).
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.