> For the complete documentation index, see [llms.txt](https://protegejj.gitbook.io/algorithm-practice/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis.md).

# LIS

- [300 Longest Increasing Subsequence](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/300-longest-increasing-subsequence.md)
- [334 Increasing Triplet Subsequence](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/334-increasing-triplet-subsequence.md)
- [354 Russian Doll Envelopes](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/354-russian-doll-envelopes.md)
- [376 Wiggle Subsequence](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/376-wiggle-subsequence.md)
- [368 Largest Divisible Subset](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/368-largest-divisible-subset.md)
- [646 Maximum Length of Pair Chain](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/646-maximum-length-of-pair-chain.md)
- [673 Number of Longest Increasing Subsequence](https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis/673-number-of-longest-increasing-subsequence.md)