> 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/30daychallenge.md).

# 30DayChallenge

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