This repository contains my solutions for LeetCode problems.
| 0024-swap-nodes-in-pairs |
| 0086-partition-list |
| 0445-add-two-numbers-ii |
| 0758-convert-binary-search-tree-to-sorted-doubly-linked-list |
| 0445-add-two-numbers-ii |
| 0556-next-greater-element-iii |
| 0633-sum-of-square-numbers |
| 0795-k-th-symbol-in-grammar |
| 0024-swap-nodes-in-pairs |
| 0795-k-th-symbol-in-grammar |
| 0287-find-the-duplicate-number |
| 0456-132-pattern |
| 0633-sum-of-square-numbers |
| 1275-validate-binary-tree-nodes |
| 1275-validate-binary-tree-nodes |
| 1275-validate-binary-tree-nodes |
| 0011-container-with-most-water |
| 0917-boats-to-save-people |
| 1988-minimize-maximum-pair-sum-in-array |
| 0917-boats-to-save-people |
| 0959-3sum-with-multiplicity |
| 1988-minimize-maximum-pair-sum-in-array |
| 0496-next-greater-element-i |
| 0959-3sum-with-multiplicity |
| 1987-substrings-of-size-three-with-distinct-characters |
| 2552-maximum-sum-of-distinct-subarrays-with-length-k |
| 0959-3sum-with-multiplicity |
| 1987-substrings-of-size-three-with-distinct-characters |
| 0020-valid-parentheses |
| 0556-next-greater-element-iii |
| 1567-maximum-number-of-vowels-in-a-substring-of-given-length |
| 1987-substrings-of-size-three-with-distinct-characters |
| 0287-find-the-duplicate-number |
| 0795-k-th-symbol-in-grammar |
| 1567-maximum-number-of-vowels-in-a-substring-of-given-length |
| 1987-substrings-of-size-three-with-distinct-characters |
| 2552-maximum-sum-of-distinct-subarrays-with-length-k |
| 0155-min-stack |
| 1497-design-a-stack-with-increment-operation |
| 0456-132-pattern |
| 0496-next-greater-element-i |
| 0503-next-greater-element-ii |
| 0739-daily-temperatures |
| 0456-132-pattern |
| 0052-n-queens-ii |
| 0153-find-minimum-in-rotated-sorted-array |
| 0758-convert-binary-search-tree-to-sorted-doubly-linked-list |
| 0758-convert-binary-search-tree-to-sorted-doubly-linked-list |
| 0133-clone-graph |
| 0323-number-of-connected-components-in-an-undirected-graph |
| 0813-all-paths-from-source-to-target |
| 1308-smallest-string-with-swaps |
| 2121-find-if-path-exists-in-graph |
| 0323-number-of-connected-components-in-an-undirected-graph |
| 1308-smallest-string-with-swaps |
| 2121-find-if-path-exists-in-graph |
| 0133-clone-graph |
| 0323-number-of-connected-components-in-an-undirected-graph |
| 0813-all-paths-from-source-to-target |
| 2121-find-if-path-exists-in-graph |
| 0079-word-search |
| 0503-next-greater-element-ii |
| 1171-shortest-path-in-binary-matrix |
| 1308-smallest-string-with-swaps |
| 2552-maximum-sum-of-distinct-subarrays-with-length-k |
| 0133-clone-graph |
| 0146-lru-cache |
| 1308-smallest-string-with-swaps |
| 2552-maximum-sum-of-distinct-subarrays-with-length-k |
| 0005-longest-palindromic-substring |
| 0079-word-search |
| 0115-distinct-subsequences |
| 1252-break-a-palindrome |
| 1308-smallest-string-with-swaps |
| 1308-smallest-string-with-swaps |
| 0079-word-search |
| 0813-all-paths-from-source-to-target |
| 0079-word-search |
| 1171-shortest-path-in-binary-matrix |
| 0764-n-ary-tree-level-order-traversal |
| 0232-implement-queue-using-stacks |
| 0503-next-greater-element-ii |
| 0146-lru-cache |
| 0232-implement-queue-using-stacks |
| 0232-implement-queue-using-stacks |
| 0005-longest-palindromic-substring |
| 0005-longest-palindromic-substring |
| 0115-distinct-subsequences |
| 0146-lru-cache |
| 0146-lru-cache |
| 2552-maximum-sum-of-distinct-subarrays-with-length-k |
| 0503-next-greater-element-ii |
| 1252-break-a-palindrome |