> For the complete documentation index, see [llms.txt](https://snowan.gitbook.io/study-notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://snowan.gitbook.io/study-notes/leetcode/python.md).

# python

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