This repository contains a collection of LeetCode solutions I have worked on, categorized by topics and problem difficulty. It serves as a reference to track my progress in solving coding problems .
| 0017-letter-combinations-of-a-phone-number |
| 0141-linked-list-cycle |
| 0142-linked-list-cycle-ii |
| 0442-find-all-duplicates-in-an-array |
| 0633-sum-of-square-numbers |
| 0853-most-profit-assigning-work |
| 0882-peak-index-in-a-mountain-array |
| 1605-minimum-number-of-days-to-make-m-bouquets |
| 0075-sort-colors |
| 0125-valid-palindrome |
| 0141-linked-list-cycle |
| 0142-linked-list-cycle-ii |
| 0344-reverse-string |
| 0633-sum-of-square-numbers |
| 0853-most-profit-assigning-work |
| 0908-middle-of-the-linked-list |
| 0017-letter-combinations-of-a-phone-number |
| 0125-valid-palindrome |
| 0344-reverse-string |
| 2021-remove-all-occurrences-of-a-substring |
| 0017-letter-combinations-of-a-phone-number |
| 0075-sort-colors |
| 0502-ipo |
| 0853-most-profit-assigning-work |
| 0982-minimum-increment-to-make-array-unique |
| 2148-minimum-number-of-moves-to-seat-everyone |
| 0330-patching-array |
| 0502-ipo |
| 0853-most-profit-assigning-work |
| 0982-minimum-increment-to-make-array-unique |
| 2148-minimum-number-of-moves-to-seat-everyone |
| 0025-reverse-nodes-in-k-group |
| 0141-linked-list-cycle |
| 0142-linked-list-cycle-ii |
| 0206-reverse-linked-list |
| 0908-middle-of-the-linked-list |
| 0025-reverse-nodes-in-k-group |
| 0206-reverse-linked-list |
| 0982-minimum-increment-to-make-array-unique |
| 0502-ipo |
| 0633-sum-of-square-numbers |
| 1138-grumpy-bookstore-owner |
| 0204-count-primes |
| 1747-lexicographically-smallest-string-after-applying-operations |
| 2174-next-greater-numerically-balanced-number |
| 3252-count-the-number-of-incremovable-subarrays-i |
| 1501-circle-and-rectangle-overlapping |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0239-sliding-window-maximum |
| 1951-find-the-winner-of-the-circular-game |
| 0914-random-point-in-non-overlapping-rectangles |
| 0914-random-point-in-non-overlapping-rectangles |
| 0914-random-point-in-non-overlapping-rectangles |
| 0187-repeated-dna-sequences |
| 0187-repeated-dna-sequences |
| 0572-subtree-of-another-tree |
| 0638-shopping-offers |
| 2130-maximum-product-of-the-length-of-two-palindromic-subsequences |
| 3233-maximize-the-number-of-partitions-after-operations |
| 3851-find-sum-of-array-product-of-magical-sequences |
| 0004-median-of-two-sorted-arrays |
| 0053-maximum-subarray |
| 0169-majority-element |
| 0190-reverse-bits |
| 0191-number-of-1-bits |
| 0324-wiggle-sort-ii |
| 0347-top-k-frequent-elements |
| 0324-wiggle-sort-ii |
| 0347-top-k-frequent-elements |
| 0070-climbing-stairs |
| 0638-shopping-offers |
| 1013-fibonacci-number |
| 0347-top-k-frequent-elements |
| 0062-unique-paths |
| 3768-check-if-digits-are-equal-in-string-after-operations-i |
| 3851-find-sum-of-array-product-of-magical-sequences |
| 0155-min-stack |
| 0173-binary-search-tree-iterator |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0937-online-stock-span |
| 0937-online-stock-span |
| 0239-sliding-window-maximum |
| 0173-binary-search-tree-iterator |
| 0207-course-schedule |
| 0210-course-schedule-ii |
| 2090-number-of-ways-to-arrive-at-destination |
| 0204-count-primes |
| 3768-check-if-digits-are-equal-in-string-after-operations-i |
| 0572-subtree-of-another-tree |
| 0130-surrounded-regions |