# Leetcode

- [30DayChallenge](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge.md)
- [LRU-cache](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/lru-cache.md)
- [backspace-string-compare](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/backspace-string-compare.md)
- [binary-tree-maximum-path-sum](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/binary-tree-maximum-path-sum.md)
- [bitwise-and-number-range](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/bitwise-and-number-range.md)
- [check-string-valid-sequence-from-root-to-leaves-path-in-bst](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/check-string-valid-sequence-from-root-to-leaves-path-in-bst.md)
- [construct-binary-search-tree-from-preorder-traversal](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/construct-binary-search-tree-from-preorder-traversal.md)
- [contiguous-array](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/contiguous-array.md)
- [counting-elements](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/counting-elements.md)
- [diameter-of-binary-tree](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/diameter-of-binary-tree.md)
- [first-unique-number](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/first-unique-number.md)
- [group-anagrams](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/group-anagrams.md)
- [jump-game](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/jump-game.md)
- [last-stone-weight](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/last-stone-weight.md)
- [leftmost-column-with-at-least-a-one](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/leftmost-column-with-at-least-a-one.md)
- [longest-common-subsequect](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/longest-common-subsequect.md)
- [maximal-square](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/maximal-square.md)
- [maximum-subarray](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/maximum-subarray.md)
- [middle-of-the-linked-list](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/middle-of-the-linked-list.md)
- [min-stack](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/min-stack.md)
- [minimun-path-sum](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/minimun-path-sum.md)
- [move-zeroes](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/move-zeroes.md)
- [perform-string-shifts](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/perform-string-shifts.md)
- [product-of-array-except-itself](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/product-of-array-except-itself.md)
- [search-in-rotated-sorted-array](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/search-in-rotated-sorted-array.md)
- [subarray-sum-equals-k](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/subarray-sum-equals-k.md)
- [valid-parenthesis-string](https://snowan.gitbook.io/study-notes/leetcode/30daychallenge/valid-parenthesis-string.md)
- [English Solution](https://snowan.gitbook.io/study-notes/leetcode/english-solution.md)
- [1168.optimize-water-distribution-in-a-village-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/1168.optimize-water-distribution-in-a-village-en.md)
- [1171.remove-zero-sum-consecutive-nodes-from-linked-list-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/1171.remove-zero-sum-consecutive-nodes-from-linked-list-en.md)
- [1177.can-make-palindrome-from-substring-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/1177.can-make-palindrome-from-substring-en.md)
- [1343.number-of-avg-subarr-sizek-greater-or-equal-threshold](https://snowan.gitbook.io/study-notes/leetcode/english-solution/1343.number-of-avg-subarr-sizek-greater-or-equal-threshold.md)
- [1345.jump-game-iv](https://snowan.gitbook.io/study-notes/leetcode/english-solution/1345.jump-game-iv.md)
- [25.reverse-nodes-in-k-groups-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/25.reverse-nodes-in-k-groups-en.md)
- [474.ones-and-zeros-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/474.ones-and-zeros-en.md)
- [53.maximum-sum-subarray-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/53.maximum-sum-subarray-en.md)
- [547.friend-circles-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/547.friend-circles-en.md)
- [79.word-search-en](https://snowan.gitbook.io/study-notes/leetcode/english-solution/79.word-search-en.md)
- [May2020Challenge](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge.md)
- [check-if-straight-line](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/check-if-straight-line.md)
- [cousins-in-binary-tree](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/cousins-in-binary-tree.md)
- [find-town-judge](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/find-town-judge.md)
- [first-bad-version](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/first-bad-version.md)
- [first-unique-character-in-a-string](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/first-unique-character-in-a-string.md)
- [flood-fill](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/flood-fill.md)
- [implement-trie](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/implement-trie.md)
- [jewels-and-stones](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/jewels-and-stones.md)
- [majority-element](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/majority-element.md)
- [maximum-sum-circular-subarray](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/maximum-sum-circular-subarray.md)
- [number-complement](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/number-complement.md)
- [odd-even-linkedlist](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/odd-even-linkedlist.md)
- [ransom-note](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/ransom-note.md)
- [remove-k-digits](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/remove-k-digits.md)
- [single-element-in-sorted-array](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/single-element-in-sorted-array.md)
- [valid-perfect-square](https://snowan.gitbook.io/study-notes/leetcode/may2020challenge/valid-perfect-square.md)
- [python](https://snowan.gitbook.io/study-notes/leetcode/python.md)
- [000017-Letter-Combinations-of-a-Phone-Number](https://snowan.gitbook.io/study-notes/leetcode/python/000017-letter-combinations-of-a-phone-number.md)
- [000032-Longest-Valid-Parentheses](https://snowan.gitbook.io/study-notes/leetcode/python/000032-longest-valid-parentheses.md)
- [000033-Search-in-Rotated-Sorted-Array](https://snowan.gitbook.io/study-notes/leetcode/python/000033-search-in-rotated-sorted-array.md)
- [000046-Permutations](https://snowan.gitbook.io/study-notes/leetcode/python/000046-permutations.md)
- [000074-Search-a-2D-Matrix](https://snowan.gitbook.io/study-notes/leetcode/python/000074-search-a-2d-matrix.md)
- [000077-Combinations](https://snowan.gitbook.io/study-notes/leetcode/python/000077-combinations.md)
- [000081-Search-in-Rotated-Sorted-Array-II](https://snowan.gitbook.io/study-notes/leetcode/python/000081-search-in-rotated-sorted-array-ii.md)
- [000137-single-number-ii](https://snowan.gitbook.io/study-notes/leetcode/python/000137-single-number-ii.md)
- [000139-Word-Break](https://snowan.gitbook.io/study-notes/leetcode/python/000139-word-break.md)
- [000207-courses-schedule](https://snowan.gitbook.io/study-notes/leetcode/python/000207-courses-schedule.md)
- [000209-Minimum-Size-Subarray-Sum](https://snowan.gitbook.io/study-notes/leetcode/python/000209-minimum-size-subarray-sum.md)
- [000376-wiggle-subsequence](https://snowan.gitbook.io/study-notes/leetcode/python/000376-wiggle-subsequence.md)
- [000445-Add-Two-Numbers-II](https://snowan.gitbook.io/study-notes/leetcode/python/000445-add-two-numbers-ii.md)
- [000486-Predict-the-Winner](https://snowan.gitbook.io/study-notes/leetcode/python/000486-predict-the-winner.md)
- [000518-Coin-Change-II](https://snowan.gitbook.io/study-notes/leetcode/python/000518-coin-change-ii.md)
- [000673-Number-of-Longest-Increasing-Subsequence](https://snowan.gitbook.io/study-notes/leetcode/python/000673-number-of-longest-increasing-subsequence.md)
- [000688-Knight-Probability-in-Chessboard](https://snowan.gitbook.io/study-notes/leetcode/python/000688-knight-probability-in-chessboard.md)
- [000735-Asteroid-Collision](https://snowan.gitbook.io/study-notes/leetcode/python/000735-asteroid-collision.md)
- [000852-Peak-Index-in-a-Mountain-Array](https://snowan.gitbook.io/study-notes/leetcode/python/000852-peak-index-in-a-mountain-array.md)
- [859-Buddy-Strings](https://snowan.gitbook.io/study-notes/leetcode/python/000859-buddy-strings.md)
- [000864-Shortest-Path-to-Get-All-Keys](https://snowan.gitbook.io/study-notes/leetcode/python/000864-shortest-path-to-get-all-keys.md)
- [000920-Number-of-Music-Playlists](https://snowan.gitbook.io/study-notes/leetcode/python/000920-number-of-music-playlists.md)
- [001218-Longest-Arithmetic-Subsequence-of-Given-Difference](https://snowan.gitbook.io/study-notes/leetcode/python/001218-longest-arithmetic-subsequence-of-given-difference.md)
- [001235-Maximum-Profit-in-Job-Scheduling](https://snowan.gitbook.io/study-notes/leetcode/python/001235-maximum-profit-in-job-scheduling.md)
- [001493-Longest-Subarray-of 1-After-Deleting-One-Element](https://snowan.gitbook.io/study-notes/leetcode/python/001493-longest-subarray-of-1-after-deleting-one-element.md)
- [Problem](https://snowan.gitbook.io/study-notes/leetcode/python/001514-path-with-maximum-probability.md)
- [002024-Maximize-the-Confusion-of-an-Exam](https://snowan.gitbook.io/study-notes/leetcode/python/002024-maximize-the-confusion-of-an-exam.md)
- [2305-Fair-Distribution-of-Cookies](https://snowan.gitbook.io/study-notes/leetcode/python/002305-fair-distribution-of-cookies.md)
- [002616-Minimize-the-Maximum-Difference-of-Pairs](https://snowan.gitbook.io/study-notes/leetcode/python/002616-minimize-the-maximum-difference-of-pairs.md)
- [00802-Find-Eventual-Safe-States](https://snowan.gitbook.io/study-notes/leetcode/python/00802-find-eventual-safe-states.md)
- [中文版解题](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti.md)
- [1147.longest-chunked-palindrome-decomposition-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/1147.longest-chunked-palindrome-decomposition-cn.md)
- [1168.optimize-water-distribution-in-a-village-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/1168.optimize-water-distribution-in-a-village-cn.md)
- [1171.remove-zero-sum-consecutive-nodes-from-linked-list-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/1171.remove-zero-sum-consecutive-nodes-from-linked-list-cn.md)
- [1177.can-make-palindrome-from-substring-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/1177.can-make-palindrome-from-substring-cn.md)
- [215.kth-largest-element-in-an-array-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/215.kth-largest-element-in-an-array-cn.md)
- [25.reverse-nodes-in-k-groups-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/25.reverse-nodes-in-k-groups-cn.md)
- [30.substring-with-concatenation-of-all-words-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/30.substring-with-concatenation-of-all-words-cn.md)
- [4.median-of-two-sorted-array-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/4.median-of-two-sorted-array-cn.md)
- [460.LFU-cache-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/460.lfu-cache-cn.md)
- [474.ones-and-zeros-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/474.ones-and-zeros-cn.md)
- [53.maximum-sum-subarray-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/53.maximum-sum-subarray-cn.md)
- [79.word-search-cn](https://snowan.gitbook.io/study-notes/leetcode/zhong-wen-ban-jie-ti/79.word-search-cn.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://snowan.gitbook.io/study-notes/leetcode.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.