This is the code that I’ve written. Some test cases are generating TLE. Please help.
LONGEST INCREASING SUBSEQUENCE
@AbhilashaBansal Time complexity of your code is O(n^2) hence it will give you TLE, try to think of any other efficient approach.
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.