LIS Family problems

9 LIS Family DSA practice problems on CampusCode, each with statement, examples and constraints.

• 1134. Longest Increasing Subsequence Length (Basic) Easy Dynamic Programming
• 1181. Longest Increasing Subsequence — O(n log n) Medium Dynamic Programming
• 1182. Longest Decreasing Subsequence Medium Dynamic Programming
• 1183. Longest Bitonic Subsequence Medium Dynamic Programming
• 1184. Number of Longest Increasing Subsequences Medium Dynamic Programming
• 1185. Largest Divisible Subset Medium Dynamic Programming
• 1186. Russian Doll Envelopes Medium Dynamic Programming
• 1187. Maximum Length of Pair Chain Medium Dynamic Programming
• 1188. Minimum Number of Removals to Make Mountain Array Medium Dynamic Programming