# 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)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://protegejj.gitbook.io/algorithm-practice/leetcode/dynamic-programming/lis.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.