Longest increasing sub doubt

#1

in this ques which method i should apply.
dp o(n^2) that is it will give me tle after 1 sec
or binary serach method with nlogn.

do dp will give tle or not

#2

Dp will give TLE because n is equal to 10^5

#3

okay i too was thinking same…
but not sure as time limit is not provided
thanks @sdevwrat

#4

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.