Repository containing all my Leet Code submissions and DSA practice solutions.
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0061-rotate-list | Medium |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0061-rotate-list | Medium |
| 0455-assign-cookies | Easy |
| 0832-flipping-an-image | Easy |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2540-minimum-common-value | Easy |
| Problem Name | Difficulty |
|---|---|
| 0001-two-sum | Easy |
| 0154-find-minimum-in-rotated-sorted-array-ii | Hard |
| 0238-product-of-array-except-self | Medium |
| 0455-assign-cookies | Easy |
| 0503-next-greater-element-ii | Medium |
| 0665-non-decreasing-array | Medium |
| 0682-baseball-game | Easy |
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 0739-daily-temperatures | Medium |
| 0832-flipping-an-image | Easy |
| 0860-lemonade-change | Easy |
| 0931-minimum-falling-path-sum | Medium |
| 1582-special-positions-in-a-binary-matrix | Easy |
| 1752-check-if-array-is-sorted-and-rotated | Easy |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 2540-minimum-common-value | Easy |
| 2553-separate-the-digits-in-an-array | Easy |
| 2574-left-and-right-sum-differences | Easy |
| 2784-check-if-array-is-good | Easy |
| 3838-weighted-word-mapping | Easy |
| Problem Name | Difficulty |
|---|---|
| 0682-baseball-game | Easy |
| 0832-flipping-an-image | Easy |
| 2553-separate-the-digits-in-an-array | Easy |
| 3612-process-string-with-special-operations-i | Medium |
| 3838-weighted-word-mapping | Easy |
| Problem Name | Difficulty |
|---|---|
| 0263-ugly-number | Easy |
| 1359-count-all-valid-pickup-and-delivery-options | Hard |
| 2929-distribute-candies-among-children-ii | Medium |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0238-product-of-array-except-self | Medium |
| 2574-left-and-right-sum-differences | Easy |
| Problem Name | Difficulty |
|---|---|
| 0001-two-sum | Easy |
| 0387-first-unique-character-in-a-string | Easy |
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| 1347-minimum-number-of-steps-to-make-two-strings-anagram | Medium |
| 2540-minimum-common-value | Easy |
| 2784-check-if-array-is-good | Easy |
| 3120-count-the-number-of-special-characters-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0387-first-unique-character-in-a-string | Easy |
| 0516-longest-palindromic-subsequence | Medium |
| 1347-minimum-number-of-steps-to-make-two-strings-anagram | Medium |
| 3120-count-the-number-of-special-characters-i | Easy |
| 3612-process-string-with-special-operations-i | Medium |
| 3838-weighted-word-mapping | Easy |
| Problem Name | Difficulty |
|---|---|
| 0225-implement-stack-using-queues | Easy |
| 0387-first-unique-character-in-a-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0387-first-unique-character-in-a-string | Easy |
| 1347-minimum-number-of-steps-to-make-two-strings-anagram | Medium |
| Problem Name | Difficulty |
|---|---|
| 0455-assign-cookies | Easy |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 2784-check-if-array-is-good | Easy |
| Problem Name | Difficulty |
|---|---|
| 0154-find-minimum-in-rotated-sorted-array-ii | Hard |
| 2540-minimum-common-value | Easy |
| Problem Name | Difficulty |
|---|---|
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| Problem Name | Difficulty |
|---|---|
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| Problem Name | Difficulty |
|---|---|
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| Problem Name | Difficulty |
|---|---|
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| Problem Name | Difficulty |
|---|---|
| 0455-assign-cookies | Easy |
| 0860-lemonade-change | Easy |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| Problem Name | Difficulty |
|---|---|
| 0516-longest-palindromic-subsequence | Medium |
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 0931-minimum-falling-path-sum | Medium |
| 1359-count-all-valid-pickup-and-delivery-options | Hard |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0698-partition-to-k-equal-sum-subsets | Medium |
| Problem Name | Difficulty |
|---|---|
| 0698-partition-to-k-equal-sum-subsets | Medium |
| 0832-flipping-an-image | Easy |
| Problem Name | Difficulty |
|---|---|
| 0698-partition-to-k-equal-sum-subsets | Medium |
| Problem Name | Difficulty |
|---|---|
| 0698-partition-to-k-equal-sum-subsets | Medium |
| Problem Name | Difficulty |
|---|---|
| 1359-count-all-valid-pickup-and-delivery-options | Hard |
| 2929-distribute-candies-among-children-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0832-flipping-an-image | Easy |
| 0931-minimum-falling-path-sum | Medium |
| 1582-special-positions-in-a-binary-matrix | Easy |
| Problem Name | Difficulty |
|---|---|
| 2929-distribute-candies-among-children-ii | Medium |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0225-implement-stack-using-queues | Easy |
| 0503-next-greater-element-ii | Medium |
| 0682-baseball-game | Easy |
| 0739-daily-temperatures | Medium |
| Problem Name | Difficulty |
|---|---|
| 0225-implement-stack-using-queues | Easy |
| Problem Name | Difficulty |
|---|---|
| 0503-next-greater-element-ii | Medium |
| 0739-daily-temperatures | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |