GitHub - knockcat/Leetcode: This Repository Contains All My Solved Leetcode Problems.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3,603 Commits
Sorry, we had to truncate this directory to 1,000 files. 387 entries were omitted from the list.
.github		.github
0001-two-sum		0001-two-sum
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0009-palindrome-number		0009-palindrome-number
0011-container-with-most-water		0011-container-with-most-water
0015-3sum		0015-3sum
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0018-4sum		0018-4sum
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation		0031-next-permutation
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0040-combination-sum-ii		0040-combination-sum-ii
0041-first-missing-positive		0041-first-missing-positive
0042-trapping-rain-water		0042-trapping-rain-water
0044-wildcard-matching		0044-wildcard-matching
0046-permutations		0046-permutations
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0058-length-of-last-word		0058-length-of-last-word
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0067-add-binary		0067-add-binary
0068-text-justification		0068-text-justification
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0081-search-in-rotated-sorted-array-ii		0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0085-maximal-rectangle		0085-maximal-rectangle
0086-partition-list		0086-partition-list
0087-scramble-string		0087-scramble-string
0088-merge-sorted-array		0088-merge-sorted-array
0090-subsets-ii		0090-subsets-ii
0091-decode-ways		0091-decode-ways
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0093-restore-ip-addresses		0093-restore-ip-addresses
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii		0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0097-interleaving-string		0097-interleaving-string
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0112-path-sum		0112-path-sum
0113-path-sum-ii		0113-path-sum-ii
0115-distinct-subsequences		0115-distinct-subsequences
0118-pascals-triangle		0118-pascals-triangle
0119-pascals-triangle-ii		0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii		0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0126-word-ladder-ii		0126-word-ladder-ii
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0130-surrounded-regions		0130-surrounded-regions
0131-palindrome-partitioning		0131-palindrome-partitioning
0132-palindrome-partitioning-ii		0132-palindrome-partitioning-ii
0133-clone-graph		0133-clone-graph
0134-gas-station		0134-gas-station
0135-candy		0135-candy
0137-single-number-ii		0137-single-number-ii
0138-copy-list-with-random-pointer		0138-copy-list-with-random-pointer
0139-word-break		0139-word-break
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache