This repository contains my LeetCode solutions in multiple programming languages.
- Total Solved: 149
- Easy: 47
- Medium: 83
- Hard: 19
| 1382-balance-a-binary-search-tree |
| 0110-balanced-binary-tree |
| 1161-maximum-level-sum-of-a-binary-tree |
| 1218-lowest-common-ancestor-of-deepest-leaves |
| 1339-maximum-product-of-splitted-binary-tree |
| 1382-balance-a-binary-search-tree |
| 2533-bitwise-xor-of-all-pairings |
| 3548-find-the-count-of-good-integers |
| 1477-product-of-the-last-k-numbers |
| 1477-product-of-the-last-k-numbers |
| 3678-design-task-manager |
| 1382-balance-a-binary-search-tree |
| 3719-longest-balanced-subarray-i |
| 3010-divide-an-array-into-subarrays-with-minimum-cost-i |
| 2975-maximum-square-area-by-removing-fences-from-a-field |
| 3278-find-the-number-of-ways-to-place-people-i |
| 3548-find-the-count-of-good-integers |
| 1266-minimum-time-visiting-all-points |
| 3278-find-the-number-of-ways-to-place-people-i |
| 2976-minimum-cost-to-convert-string-i |
| 3650-minimum-cost-path-with-edge-reversals |
| 2977-minimum-cost-to-convert-string-ii |
| 3309-count-prefix-and-suffix-pairs-i |
| 2610-closest-prime-numbers-in-range |
| 3790-fruits-into-baskets-ii |
| 3678-design-task-manager |
| 0231-power-of-two |
| 2050-count-good-numbers |
| 3309-count-prefix-and-suffix-pairs-i |
| 3790-fruits-into-baskets-ii |
| 3719-longest-balanced-subarray-i |
| 1524-string-matching-in-an-array |
| 2292-counting-words-with-a-given-prefix |
| 3309-count-prefix-and-suffix-pairs-i |
| 0110-balanced-binary-tree |
| 1161-maximum-level-sum-of-a-binary-tree |
| 1218-lowest-common-ancestor-of-deepest-leaves |
| 1339-maximum-product-of-splitted-binary-tree |
| 1382-balance-a-binary-search-tree |
| 3309-count-prefix-and-suffix-pairs-i |
| 2977-minimum-cost-to-convert-string-ii |