insurence exam AIC MT (Generalist & IT) Mock Test Series 2025 Algorithms Algorithm Design Techniques Dynamic Programming
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is
1
O(n)
2
O(n Ig n)
3
O(n2)
4
O(log n)
5
None of the above