This repository provides a comprehensive overview of my progress and achievements in tackling various challenges on LeetCode, a renowned platform for honing programming and problem-solving skills. It serves as a dynamic showcase of my journey, highlighting both completed solutions and ongoing efforts.
| 0060-permutation-sequence |
| 0069-sqrtx |
| 0231-power-of-two |
| 0282-expression-add-operators |
| 1370-count-number-of-nice-subarrays |
| 1951-find-the-winner-of-the-circular-game |
| 0287-find-the-duplicate-number |
| 0330-patching-array |
| 0409-longest-palindrome |
| 0982-minimum-increment-to-make-array-unique |
| 1285-balance-a-binary-search-tree |
| 2148-minimum-number-of-moves-to-seat-everyone |
| 1016-subarray-sums-divisible-by-k |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 3383-taking-maximum-energy-from-the-mystic-dungeon |
| 0982-minimum-increment-to-make-array-unique |
| 1675-magnetic-force-between-two-balls |
| 2148-minimum-number-of-moves-to-seat-everyone |
| 2696-the-number-of-beautiful-subsets |
| 0206-reverse-linked-list |
| 0060-permutation-sequence |
| 0206-reverse-linked-list |
| 0231-power-of-two |
| 1951-find-the-winner-of-the-circular-game |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1951-find-the-winner-of-the-circular-game |
| 1951-find-the-winner-of-the-circular-game |
| 0982-minimum-increment-to-make-array-unique |
| 0037-sudoku-solver |
| 0079-word-search |
| 0100-same-tree |
| 0102-binary-tree-level-order-traversal |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0112-path-sum |
| 1120-flower-planting-with-no-adjacent |
| 1120-flower-planting-with-no-adjacent |
| 1916-find-center-of-star-graph |
| 0022-generate-parentheses |
| 0124-binary-tree-maximum-path-sum |
| 0131-palindrome-partitioning |
| 0139-word-break |
| 0140-word-break-ii |
| 2696-the-number-of-beautiful-subsets |
| 0139-word-break |
| 0140-word-break-ii |
| 0139-word-break |
| 0140-word-break-ii |
| 2170-count-number-of-maximum-bitwise-or-subsets |
| 1211-iterator-for-combination |
| 1211-iterator-for-combination |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 0094-binary-tree-inorder-traversal |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0538-convert-bst-to-greater-tree |
| 1114-binary-search-tree-to-greater-sum-tree |
| 1285-balance-a-binary-search-tree |
| 1285-balance-a-binary-search-tree |
| 1120-flower-planting-with-no-adjacent |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph |
| 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable |
| 2379-maximum-total-importance-of-roads |
| 2379-maximum-total-importance-of-roads |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph |
| 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable |
| 0222-count-complete-tree-nodes |
| 0350-intersection-of-two-arrays-ii |
| 0105-construct-binary-tree-from-preorder-and-inorder-traversal |
| 0106-construct-binary-tree-from-inorder-and-postorder-traversal |
| 0108-convert-sorted-array-to-binary-search-tree |
| 0297-serialize-and-deserialize-binary-tree |
| 0202-happy-number |
| 0350-intersection-of-two-arrays-ii |
| 0941-sort-array-by-parity |
| 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence |
| 1803-average-waiting-time |
| 1951-find-the-winner-of-the-circular-game |
| 2299-merge-nodes-in-between-zeros |
| 2645-pass-the-pillow |
| 1951-find-the-winner-of-the-circular-game |
| 1951-find-the-winner-of-the-circular-game |
| 1050-construct-binary-search-tree-from-preorder-traversal |
| 0022-generate-parentheses |
| 0124-binary-tree-maximum-path-sum |
| 0131-palindrome-partitioning |
| 0139-word-break |
| 1160-letter-tile-possibilities |
| 3276-minimum-number-of-pushes-to-type-word-ii |
| 0037-sudoku-solver |
| 1331-path-with-maximum-gold |
| 1993-sum-of-all-subset-xor-totals |
| 0834-ambiguous-coordinates |
| 1993-sum-of-all-subset-xor-totals |
| 0139-word-break |
| 0139-word-break |
| 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence |