Problem Submissions Solution
Longest Increasing Subsequence
Difficulty: Medium
Acceptance: %
Points: 30.00
Given an array arr[] of size n, the task is to find the length of the Longest Increasing Subsequence (LIS) i.e., the longest possible subsequence in which the elements of the subsequence are sorted in increasing order.
Examples:
Expected Time Complexity: O(n * n)
Expected Auxiliary Space: O(n)
Constraints:
- 1 = arr.size() = 10^3
- 0 = arr[i] = 10^6
Companies:
Amazon Microsoft Samsung Paytm
Topics:
Array Dynamic Programming
