I am doing in the same approach as of the longest increasing subsequence in O(n^2), which is giving TLE. how can I optimize it
How to optimize more
@tilakparth123 hey LIS can be done nlogn here is approach for that ,please read it:
https://codeforces.com/blog/entry/19620
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.