Daily leetcode problem solutions collection. Created using LeetHub v3
| Problem Name | Difficulty |
|---|---|
| 0042-trapping-rain-water | Hard |
| 0143-reorder-list | Medium |
| 0225-implement-stack-using-queues | Easy |
| 0682-baseball-game | Easy |
| 0901-online-stock-span | Medium |
| 1475-final-prices-with-a-special-discount-in-a-shop | Easy |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0042-trapping-rain-water | Hard |
| 0901-online-stock-span | Medium |
| 1475-final-prices-with-a-special-discount-in-a-shop | Easy |
| Problem Name | Difficulty |
|---|---|
| 0225-implement-stack-using-queues | Easy |
| 0901-online-stock-span | Medium |
| Problem Name | Difficulty |
|---|---|
| 0901-online-stock-span | Medium |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0036-valid-sudoku | Medium |
| 0049-group-anagrams | Medium |
| 0128-longest-consecutive-sequence | Medium |
| 0138-copy-list-with-random-pointer | Medium |
| 0141-linked-list-cycle | Easy |
| 0219-contains-duplicate-ii | Easy |
| 0229-majority-element-ii | Medium |
| 0424-longest-repeating-character-replacement | Medium |
| 0525-contiguous-array | Medium |
| 0567-permutation-in-string | Medium |
| 2133-check-if-every-row-and-column-contains-all-numbers | Easy |
| 2598-smallest-missing-non-negative-integer-after-operations | Medium |
| 2784-check-if-array-is-good | Easy |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0049-group-anagrams | Medium |
| 0125-valid-palindrome | Easy |
| 0424-longest-repeating-character-replacement | Medium |
| 0567-permutation-in-string | Medium |
| 0657-robot-return-to-origin | Easy |
| 0796-rotate-string | Easy |
| 2515-shortest-distance-to-target-string-in-a-circular-array | Easy |
| 2839-check-if-strings-can-be-made-equal-with-operations-i | Easy |
| 3856-trim-trailing-vowels | Easy |
| Problem Name | Difficulty |
|---|---|
| 0015-3sum | Medium |
| 0018-4sum | Medium |
| 0049-group-anagrams | Medium |
| 0088-merge-sorted-array | Easy |
| 0229-majority-element-ii | Medium |
| 2784-check-if-array-is-good | Easy |
| Problem Name | Difficulty |
|---|---|
| 0042-trapping-rain-water | Hard |
| 0121-best-time-to-buy-and-sell-stock | Easy |
| 0122-best-time-to-buy-and-sell-stock-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0036-valid-sudoku | Medium |
| 0074-search-a-2d-matrix | Medium |
| 2133-check-if-every-row-and-column-contains-all-numbers | Easy |
| Problem Name | Difficulty |
|---|---|
| 0128-longest-consecutive-sequence | Medium |
| Problem Name | Difficulty |
|---|---|
| 0015-3sum | Medium |
| 0018-4sum | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0026-remove-duplicates-from-sorted-array | Easy |
| 0042-trapping-rain-water | Hard |
| 0061-rotate-list | Medium |
| 0088-merge-sorted-array | Easy |
| 0125-valid-palindrome | Easy |
| 0141-linked-list-cycle | Easy |
| 0143-reorder-list | Medium |
| 0167-two-sum-ii-input-array-is-sorted | Medium |
| 0567-permutation-in-string | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0033-search-in-rotated-sorted-array | Medium |
| 0035-search-insert-position | Easy |
| 0069-sqrtx | Easy |
| 0074-search-a-2d-matrix | Medium |
| 0153-find-minimum-in-rotated-sorted-array | Medium |
| 0167-two-sum-ii-input-array-is-sorted | Medium |
| 0209-minimum-size-subarray-sum | Medium |
| 0367-valid-perfect-square | Easy |
| 0374-guess-number-higher-or-lower | Easy |
| 0704-binary-search | Easy |
| 0875-koko-eating-bananas | Medium |
| 2529-maximum-count-of-positive-integer-and-negative-integer | Easy |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0209-minimum-size-subarray-sum | Medium |
| 0219-contains-duplicate-ii | Easy |
| 0424-longest-repeating-character-replacement | Medium |
| 0567-permutation-in-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0122-best-time-to-buy-and-sell-stock-ii | Medium |
| 2078-two-furthest-houses-with-different-colors | Easy |
| 2598-smallest-missing-non-negative-integer-after-operations | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0069-sqrtx | Easy |
| 0367-valid-perfect-square | Easy |
| 1290-convert-binary-number-in-a-linked-list-to-integer | Easy |
| 2598-smallest-missing-non-negative-integer-after-operations | Medium |
| 2807-insert-greatest-common-divisors-in-linked-list | Medium |
| 3783-mirror-distance-of-an-integer | Easy |
| 3870-count-commas-in-range | Easy |
| 3871-count-commas-in-range-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0209-minimum-size-subarray-sum | Medium |
| 0525-contiguous-array | Medium |
| Problem Name | Difficulty |
|---|---|
| 0229-majority-element-ii | Medium |
| 2529-maximum-count-of-positive-integer-and-negative-integer | Easy |
| Problem Name | Difficulty |
|---|---|
| 0374-guess-number-higher-or-lower | Easy |
| Problem Name | Difficulty |
|---|---|
| 0657-robot-return-to-origin | Easy |
| 0682-baseball-game | Easy |
| 2181-merge-nodes-in-between-zeros | Medium |
| 2553-separate-the-digits-in-an-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0225-implement-stack-using-queues | Easy |
| Problem Name | Difficulty |
|---|---|
| 0078-subsets | Medium |
| Problem Name | Difficulty |
|---|---|
| 0078-subsets | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0061-rotate-list | Medium |
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0138-copy-list-with-random-pointer | Medium |
| 0141-linked-list-cycle | Easy |
| 0143-reorder-list | Medium |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| 1290-convert-binary-number-in-a-linked-list-to-integer | Easy |
| 1669-merge-in-between-linked-lists | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 2181-merge-nodes-in-between-zeros | Medium |
| 2807-insert-greatest-common-divisors-in-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0143-reorder-list | Medium |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0796-rotate-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 2807-insert-greatest-common-divisors-in-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0538-convert-bst-to-greater-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| 1038-binary-search-tree-to-greater-sum-tree | Medium |
| 1302-deepest-leaves-sum | Medium |
| 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree | Easy |
| 2236-root-equals-sum-of-children | Easy |
| 2265-count-nodes-equal-to-average-of-subtree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0538-convert-bst-to-greater-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| 1038-binary-search-tree-to-greater-sum-tree | Medium |
| 1302-deepest-leaves-sum | Medium |
| 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree | Easy |
| 2265-count-nodes-equal-to-average-of-subtree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0538-convert-bst-to-greater-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| 1038-binary-search-tree-to-greater-sum-tree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0538-convert-bst-to-greater-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| 1038-binary-search-tree-to-greater-sum-tree | Medium |
| 1302-deepest-leaves-sum | Medium |
| 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree | Easy |
| 2236-root-equals-sum-of-children | Easy |
| 2265-count-nodes-equal-to-average-of-subtree | Medium |
| Problem Name | Difficulty |
|---|---|
| 1302-deepest-leaves-sum | Medium |
| 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree | Easy |