This repository contains my solutions of LeetCode problems.
| 0042-trapping-rain-water |
| 0053-maximum-subarray |
| 0121-best-time-to-buy-and-sell-stock |
| 0002-add-two-numbers |
| 0021-merge-two-sorted-lists |
| 0206-reverse-linked-list |
| 0020-valid-parentheses |
| 0042-trapping-rain-water |
| 1679-shortest-subarray-to-be-removed-to-make-array-sorted |
| 0053-maximum-subarray |
| 0191-number-of-1-bits |
| 0002-add-two-numbers |
| 0048-rotate-image |
| 0223-rectangle-area |
| 0268-missing-number |
| 2716-prime-subtraction-operation |
| 0039-combination-sum |
| 0100-same-tree |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0226-invert-binary-tree |
| 0543-diameter-of-binary-tree |
| 0572-subtree-of-another-tree |
| 0100-same-tree |
| 0104-maximum-depth-of-binary-tree |
| 0226-invert-binary-tree |
| 0543-diameter-of-binary-tree |
| 0572-subtree-of-another-tree |
| 2201-valid-arrangement-of-pairs |
| 0100-same-tree |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0226-invert-binary-tree |
| 0543-diameter-of-binary-tree |
| 0572-subtree-of-another-tree |
| 0572-subtree-of-another-tree |
| 0812-rotate-string |
| 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence |
| 2356-largest-combination-with-bitwise-and-greater-than-zero |
| 0238-product-of-array-except-self |
| 0892-shortest-subarray-with-sum-at-least-k |
| 1940-maximum-xor-for-each-query |
| 2089-maximum-matrix-sum |
| 2716-prime-subtraction-operation |
| 2716-prime-subtraction-operation |
| 0042-trapping-rain-water |
| 1679-shortest-subarray-to-be-removed-to-make-array-sorted |
| 0892-shortest-subarray-with-sum-at-least-k |
| 0892-shortest-subarray-with-sum-at-least-k |
| 2375-minimum-obstacle-removal-to-reach-corner |
| 2711-minimum-time-to-visit-a-cell-in-a-grid |
| 0892-shortest-subarray-with-sum-at-least-k |
| 2232-adding-spaces-to-a-string |
| 2343-count-unguarded-cells-in-the-grid |
| 2201-valid-arrangement-of-pairs |
| 2375-minimum-obstacle-removal-to-reach-corner |
| 2711-minimum-time-to-visit-a-cell-in-a-grid |
| 3189-find-champion-ii |
| 3517-shortest-distance-after-road-addition-queries-i |
| 2375-minimum-obstacle-removal-to-reach-corner |
| 2711-minimum-time-to-visit-a-cell-in-a-grid |
| 2201-valid-arrangement-of-pairs |
| 0572-subtree-of-another-tree |
| 0817-design-hashmap |
| 0223-rectangle-area |
| 0817-design-hashmap |