# LIS

- [300 Longest Increasing Subsequence](/oj-practices/chapter1/dynamic-programming/lis/300-longest-increasing-subsequence.md)
- [334 Increasing Triplet Subsequence](/oj-practices/chapter1/dynamic-programming/lis/334-increasing-triplet-subsequence.md)
- [354 Russian Doll Envelopes](/oj-practices/chapter1/dynamic-programming/lis/354-russian-doll-envelopes.md)
- [368 Largest Divisible Subset](/oj-practices/chapter1/dynamic-programming/lis/368-largest-divisible-subset.md)
- [646 Maximum Length of Pair Chain](/oj-practices/chapter1/dynamic-programming/lis/646-maximum-length-of-pair-chain.md)
- [673 Number of Longest Increasing Subsequence](/oj-practices/chapter1/dynamic-programming/lis/673-number-of-longest-increasing-subsequence.md)