A repository which I store my LeetCode AC submissions.
| Problem Name | Difficulty |
|---|---|
| 0005-longest-palindromic-substring | Medium |
| 0010-regular-expression-matching | Hard |
| 0022-generate-parentheses | Medium |
| 0032-longest-valid-parentheses | Hard |
| 0042-trapping-rain-water | Hard |
| 0045-jump-game-ii | Medium |
| 0053-maximum-subarray | Medium |
| 0055-jump-game | Medium |
| 0062-unique-paths | Medium |
| 0064-minimum-path-sum | Medium |
| 0070-climbing-stairs | Easy |
| 0072-edit-distance | Medium |
| 0091-decode-ways | Medium |
| 0121-best-time-to-buy-and-sell-stock | Easy |
| 0300-longest-increasing-subsequence | Medium |
| 0313-super-ugly-number | Medium |
| 0322-coin-change | Medium |
| 0377-combination-sum-iv | Medium |
| 0474-ones-and-zeroes | Medium |
| 0673-number-of-longest-increasing-subsequence | Medium |
| 0740-delete-and-earn | Medium |
| 0983-minimum-cost-for-tickets | Medium |
| 1035-uncrossed-lines | Medium |
| 1105-filling-bookcase-shelves | Medium |
| 1626-best-team-with-no-conflicts | Medium |
| 2466-count-ways-to-build-good-strings | Medium |
| Problem Name | Difficulty |
|---|---|
| 0001-two-sum | Easy |
| 0003-longest-substring-without-repeating-characters | Medium |
| 0012-integer-to-roman | Medium |
| 0013-roman-to-integer | Easy |
| 0017-letter-combinations-of-a-phone-number | Medium |
| 0036-valid-sudoku | Medium |
| 0041-first-missing-positive | Hard |
| 0049-group-anagrams | Medium |
| 0076-minimum-window-substring | Hard |
| 0146-lru-cache | Medium |
| 0740-delete-and-earn | Medium |
| 2784-check-if-array-is-good | Easy |
| 3120-count-the-number-of-special-characters-i | Easy |
| 3121-count-the-number-of-special-characters-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0005-longest-palindromic-substring | Medium |
| 0006-zigzag-conversion | Medium |
| 0008-string-to-integer-atoi | Medium |
| 0010-regular-expression-matching | Hard |
| 0012-integer-to-roman | Medium |
| 0013-roman-to-integer | Easy |
| 0014-longest-common-prefix | Easy |
| 0017-letter-combinations-of-a-phone-number | Medium |
| 0020-valid-parentheses | Easy |
| 0022-generate-parentheses | Medium |
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0032-longest-valid-parentheses | Hard |
| 0038-count-and-say | Medium |
| 0043-multiply-strings | Medium |
| 0049-group-anagrams | Medium |
| 0058-length-of-last-word | Easy |
| 0067-add-binary | Easy |
| 0071-simplify-path | Medium |
| 0072-edit-distance | Medium |
| 0076-minimum-window-substring | Hard |
| 0079-word-search | Medium |
| 0091-decode-ways | Medium |
| 0093-restore-ip-addresses | Medium |
| 0474-ones-and-zeroes | Medium |
| 3120-count-the-number-of-special-characters-i | Easy |
| 3121-count-the-number-of-special-characters-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0010-regular-expression-matching | Hard |
| 0021-merge-two-sorted-lists | Easy |
| 0024-swap-nodes-in-pairs | Medium |
| 0025-reverse-nodes-in-k-group | Hard |
| 0050-powx-n | Medium |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0076-minimum-window-substring | Hard |
| Problem Name | Difficulty |
|---|---|
| 0004-median-of-two-sorted-arrays | Hard |
| 0033-search-in-rotated-sorted-array | Medium |
| 0034-find-first-and-last-position-of-element-in-sorted-array | Medium |
| 0035-search-insert-position | Easy |
| 0069-sqrtx | Easy |
| 0074-search-a-2d-matrix | Medium |
| 0081-search-in-rotated-sorted-array-ii | Medium |
| 0154-find-minimum-in-rotated-sorted-array-ii | Hard |
| 0167-two-sum-ii-input-array-is-sorted | Medium |
| 0300-longest-increasing-subsequence | Medium |
| Problem Name | Difficulty |
|---|---|
| 0004-median-of-two-sorted-arrays | Hard |
| 0023-merge-k-sorted-lists | Hard |
| 0053-maximum-subarray | Medium |
| Problem Name | Difficulty |
|---|---|
| 0005-longest-palindromic-substring | Medium |
| 0011-container-with-most-water | Medium |
| 0015-3sum | Medium |
| 0016-3sum-closest | Medium |
| 0018-4sum | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0026-remove-duplicates-from-sorted-array | Easy |
| 0027-remove-element | Easy |
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0031-next-permutation | Medium |
| 0042-trapping-rain-water | Hard |
| 0061-rotate-list | Medium |
| 0075-sort-colors | Medium |
| 0080-remove-duplicates-from-sorted-array-ii | Medium |
| 0082-remove-duplicates-from-sorted-list-ii | Medium |
| 0086-partition-list | Medium |
| 0088-merge-sorted-array | Easy |
| 0167-two-sum-ii-input-array-is-sorted | Medium |
| 1861-rotating-the-box | Medium |
| Problem Name | Difficulty |
|---|---|
| 0007-reverse-integer | Medium |
| 0009-palindrome-number | Easy |
| 0012-integer-to-roman | Medium |
| 0013-roman-to-integer | Easy |
| 0029-divide-two-integers | Medium |
| 0043-multiply-strings | Medium |
| 0048-rotate-image | Medium |
| 0050-powx-n | Medium |
| 0062-unique-paths | Medium |
| 0066-plus-one | Easy |
| 0067-add-binary | Easy |
| 0069-sqrtx | Easy |
| 0070-climbing-stairs | Easy |
| 0089-gray-code | Medium |
| 0313-super-ugly-number | Medium |
| 3300-minimum-element-after-replacement-with-digit-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0045-jump-game-ii | Medium |
| 0055-jump-game | Medium |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| Problem Name | Difficulty |
|---|---|
| 0014-longest-common-prefix | Easy |
| Problem Name | Difficulty |
|---|---|
| 0015-3sum | Medium |
| 0016-3sum-closest | Medium |
| 0018-4sum | Medium |
| 0047-permutations-ii | Medium |
| 0049-group-anagrams | Medium |
| 0056-merge-intervals | Medium |
| 0075-sort-colors | Medium |
| 0088-merge-sorted-array | Easy |
| 1626-best-team-with-no-conflicts | Medium |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 2784-check-if-array-is-good | Easy |
| Problem Name | Difficulty |
|---|---|
| 0017-letter-combinations-of-a-phone-number | Medium |
| 0022-generate-parentheses | Medium |
| 0039-combination-sum | Medium |
| 0040-combination-sum-ii | Medium |
| 0046-permutations | Medium |
| 0047-permutations-ii | Medium |
| 0051-n-queens | Hard |
| 0052-n-queens-ii | Hard |
| 0077-combinations | Medium |
| 0078-subsets | Medium |
| 0079-word-search | Medium |
| 0089-gray-code | Medium |
| 0090-subsets-ii | Medium |
| 0093-restore-ip-addresses | Medium |
| Problem Name | Difficulty |
|---|---|
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0023-merge-k-sorted-lists | Hard |
| 0024-swap-nodes-in-pairs | Medium |
| 0025-reverse-nodes-in-k-group | Hard |
| 0061-rotate-list | Medium |
| 0082-remove-duplicates-from-sorted-list-ii | Medium |
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0086-partition-list | Medium |
| 0092-reverse-linked-list-ii | Medium |
| 0146-lru-cache | Medium |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0032-longest-valid-parentheses | Hard |
| 0042-trapping-rain-water | Hard |
| 0071-simplify-path | Medium |
| 0084-largest-rectangle-in-histogram | Hard |
| 0094-binary-tree-inorder-traversal | Easy |
| Problem Name | Difficulty |
|---|---|
| 0023-merge-k-sorted-lists | Hard |
| Problem Name | Difficulty |
|---|---|
| 0023-merge-k-sorted-lists | Hard |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0029-divide-two-integers | Medium |
| 0067-add-binary | Easy |
| 0078-subsets | Medium |
| 0089-gray-code | Medium |
| 0090-subsets-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0036-valid-sudoku | Medium |
| 0048-rotate-image | Medium |
| 0054-spiral-matrix | Medium |
| 0059-spiral-matrix-ii | Medium |
| 0064-minimum-path-sum | Medium |
| 0074-search-a-2d-matrix | Medium |
| 0079-word-search | Medium |
| 1861-rotating-the-box | Medium |
| Problem Name | Difficulty |
|---|---|
| 0042-trapping-rain-water | Hard |
| 0084-largest-rectangle-in-histogram | Hard |
| Problem Name | Difficulty |
|---|---|
| 0043-multiply-strings | Medium |
| 0054-spiral-matrix | Medium |
| 0059-spiral-matrix-ii | Medium |
| 0067-add-binary | Easy |
| 2553-separate-the-digits-in-an-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0062-unique-paths | Medium |
| Problem Name | Difficulty |
|---|---|
| 0322-coin-change | Medium |
| Problem Name | Difficulty |
|---|---|
| 0673-number-of-longest-increasing-subsequence | Medium |
| Problem Name | Difficulty |
|---|---|
| 0673-number-of-longest-increasing-subsequence | Medium |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0098-validate-binary-search-tree | Medium |
| 0450-delete-node-in-a-bst | Medium |
| 0543-diameter-of-binary-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0079-word-search | Medium |
| 0094-binary-tree-inorder-traversal | Easy |
| 0098-validate-binary-search-tree | Medium |
| 0543-diameter-of-binary-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0098-validate-binary-search-tree | Medium |
| 0450-delete-node-in-a-bst | Medium |
| 0543-diameter-of-binary-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0098-validate-binary-search-tree | Medium |
| 0450-delete-node-in-a-bst | Medium |
| Problem Name | Difficulty |
|---|---|
| 0146-lru-cache | Medium |
| Problem Name | Difficulty |
|---|---|
| 0146-lru-cache | Medium |