this code is giving tle on submission…plz provide the code with corrections…
Longest inc subsequence
the desired time complexity is O(nlogn)
since
the constraints are
0< n< 10^5
so if u do it in O(N^2)
then 10^10
so this is giving TLE
u can refer to this article in ordeer to learn how to do it in O(nlogn) time
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.