Timeline:
September 2024 - Present
Languages Used:
- Python3
- Java
I started by going through the Blind-75 Playlist from NeetCode to learn dynamic programming and data structures.
- Completion Date: 2025-01-21
- NeetCode Blind-75 Playlist
Now, I am working through Sean Prashad’s Leetcode Patterns to further enhance my problem-solving skills.
-
Currently done 30/174 Problems
- Neetcode 150, Neetcode 250
- Create a journal entry on how LeetCode affected my problem solving skills.
This repository contains my Leetcode submissions from September 2024 onwards. I have been progressively working on solving algorithmic problems and applying various data structures and dynamic programming techniques.
Feel free to explore my submissions and patterns I have learned along the way!
| Problem Name | Difficulty |
|---|---|
| 0001-two-sum | Easy |
| 0011-container-with-most-water | Medium |
| 0015-3sum | Medium |
| 0026-remove-duplicates-from-sorted-array | Easy |
| 0027-remove-element | Easy |
| 0033-search-in-rotated-sorted-array | Medium |
| 0064-minimum-path-sum | Medium |
| 0080-remove-duplicates-from-sorted-array-ii | Medium |
| 0088-merge-sorted-array | Easy |
| 0169-majority-element | Easy |
| 0209-minimum-size-subarray-sum | Medium |
| 0268-missing-number | Easy |
| 0283-move-zeroes | Easy |
| 0303-range-sum-query-immutable | Easy |
| 0322-coin-change | Medium |
| 0448-find-all-numbers-disappeared-in-an-array | Easy |
| 0643-maximum-average-subarray-i | Easy |
| 0713-subarray-product-less-than-k | Medium |
| 0744-find-smallest-letter-greater-than-target | Easy |
| 0746-min-cost-climbing-stairs | Easy |
| 0881-boats-to-save-people | Medium |
| 1091-shortest-path-in-binary-matrix | Medium |
| 2022-convert-1d-array-into-2d-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0209-minimum-size-subarray-sum | Medium |
| 0643-maximum-average-subarray-i | Easy |
| 0713-subarray-product-less-than-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0015-3sum | Medium |
| 0026-remove-duplicates-from-sorted-array | Easy |
| 0027-remove-element | Easy |
| 0080-remove-duplicates-from-sorted-array-ii | Medium |
| 0088-merge-sorted-array | Easy |
| 0125-valid-palindrome | Easy |
| 0141-linked-list-cycle | Easy |
| 0234-palindrome-linked-list | Easy |
| 0283-move-zeroes | Easy |
| 0392-is-subsequence | Easy |
| 0844-backspace-string-compare | Easy |
| 0876-middle-of-the-linked-list | Easy |
| 0881-boats-to-save-people | Medium |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0125-valid-palindrome | Easy |
| 0242-valid-anagram | Easy |
| 0257-binary-tree-paths | Easy |
| 0392-is-subsequence | Easy |
| 0844-backspace-string-compare | Easy |
| Problem Name | Difficulty |
|---|---|
| 0062-unique-paths | Medium |
| 0064-minimum-path-sum | Medium |
| 0070-climbing-stairs | Easy |
| 0322-coin-change | Medium |
| 0392-is-subsequence | Easy |
| 0746-min-cost-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0234-palindrome-linked-list | Easy |
| 0844-backspace-string-compare | Easy |
| Problem Name | Difficulty |
|---|---|
| 0844-backspace-string-compare | Easy |
| 2022-convert-1d-array-into-2d-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0001-two-sum | Easy |
| 0003-longest-substring-without-repeating-characters | Medium |
| 0141-linked-list-cycle | Easy |
| 0169-majority-element | Easy |
| 0242-valid-anagram | Easy |
| 0268-missing-number | Easy |
| 0448-find-all-numbers-disappeared-in-an-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0007-reverse-integer | Medium |
| 0009-palindrome-number | Easy |
| 0062-unique-paths | Medium |
| 0070-climbing-stairs | Easy |
| 0268-missing-number | Easy |
| Problem Name | Difficulty |
|---|---|
| 0033-search-in-rotated-sorted-array | Medium |
| 0209-minimum-size-subarray-sum | Medium |
| 0268-missing-number | Easy |
| 0713-subarray-product-less-than-k | Medium |
| 0744-find-smallest-letter-greater-than-target | Easy |
| Problem Name | Difficulty |
|---|---|
| 0268-missing-number | Easy |
| Problem Name | Difficulty |
|---|---|
| 0015-3sum | Medium |
| 0088-merge-sorted-array | Easy |
| 0169-majority-element | Easy |
| 0242-valid-anagram | Easy |
| 0268-missing-number | Easy |
| 0881-boats-to-save-people | Medium |
| Problem Name | Difficulty |
|---|---|
| 0169-majority-element | Easy |
| Problem Name | Difficulty |
|---|---|
| 0169-majority-element | Easy |
| Problem Name | Difficulty |
|---|---|
| 0169-majority-element | Easy |
| Problem Name | Difficulty |
|---|---|
| 0209-minimum-size-subarray-sum | Medium |
| 0303-range-sum-query-immutable | Easy |
| 0713-subarray-product-less-than-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0141-linked-list-cycle | Easy |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| 0234-palindrome-linked-list | Easy |
| 0876-middle-of-the-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0141-linked-list-cycle | Easy |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| 0234-palindrome-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0226-invert-binary-tree | Easy |
| 0322-coin-change | Medium |
| 0617-merge-two-binary-trees | Easy |
| 0637-average-of-levels-in-binary-tree | Easy |
| 1091-shortest-path-in-binary-matrix | Medium |
| Problem Name | Difficulty |
|---|---|
| 0322-coin-change | Medium |
| Problem Name | Difficulty |
|---|---|
| 0322-coin-change | Medium |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0062-unique-paths | Medium |
| Problem Name | Difficulty |
|---|---|
| 0064-minimum-path-sum | Medium |
| 1091-shortest-path-in-binary-matrix | Medium |
| 2022-convert-1d-array-into-2d-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0881-boats-to-save-people | Medium |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0226-invert-binary-tree | Easy |
| 0257-binary-tree-paths | Easy |
| 0572-subtree-of-another-tree | Easy |
| 0617-merge-two-binary-trees | Easy |
| 0637-average-of-levels-in-binary-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0226-invert-binary-tree | Easy |
| 0257-binary-tree-paths | Easy |
| 0572-subtree-of-another-tree | Easy |
| 0617-merge-two-binary-trees | Easy |
| 0637-average-of-levels-in-binary-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0226-invert-binary-tree | Easy |
| 0257-binary-tree-paths | Easy |
| 0572-subtree-of-another-tree | Easy |
| 0617-merge-two-binary-trees | Easy |
| 0637-average-of-levels-in-binary-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0572-subtree-of-another-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0572-subtree-of-another-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0257-binary-tree-paths | Easy |
| Problem Name | Difficulty |
|---|---|
| 0303-range-sum-query-immutable | Easy |
| Problem Name | Difficulty |
|---|---|
| 0881-boats-to-save-people | Medium |