A continuously updated repository documenting my problem-solving journey on LeetCode. This collection serves as a personal log of algorithmic challenges, data structure implementations, and competitive programming solutions.
The solutions in this repository are automatically synchronised immediately after a successful submission on LeetCode. Each commit automatically logs the code alongside its specific performance statistics.
- Execution Time: To ensure time-complexity optimisation.
- Memory Usage: To monitor space-complexity efficiency.
- Tech Stack: Primarily focusing on robust Java, C++ implementations.
Automatically generated and synced via browser extension.
| Problem Name | Difficulty |
|---|---|
| 0128-longest-consecutive-sequence | Medium |
| Problem Name | Difficulty |
|---|---|
| 0053-maximum-subarray | Medium |
| 0191-number-of-1-bits | Easy |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0053-maximum-subarray | Medium |
| 0055-jump-game | Medium |
| 0338-counting-bits | Easy |
| 0396-rotate-function | Medium |
| 0509-fibonacci-number | Easy |
| 0877-stone-game | Medium |
| 0907-sum-of-subarray-minimums | Medium |
| 1493-longest-subarray-of-1s-after-deleting-one-element | Medium |
| Problem Name | Difficulty |
|---|---|
| 0078-subsets | Medium |
| 0137-single-number-ii | Medium |
| 0191-number-of-1-bits | Easy |
| 0231-power-of-two | Easy |
| 0287-find-the-duplicate-number | Medium |
| 0338-counting-bits | Easy |
| 1457-pseudo-palindromic-paths-in-a-binary-tree | Medium |
| 3702-longest-subsequence-with-non-zero-bitwise-xor | Medium |
| Problem Name | Difficulty |
|---|---|
| 0209-minimum-size-subarray-sum | Medium |
| 0238-product-of-array-except-self | Medium |
| 0560-subarray-sum-equals-k | Medium |
| 0713-subarray-product-less-than-k | Medium |
| 1004-max-consecutive-ones-iii | Medium |
| 1248-count-number-of-nice-subarrays | Medium |
| 1732-find-the-highest-altitude | Easy |
| 2024-maximize-the-confusion-of-an-exam | Medium |
| 2302-count-subarrays-with-score-less-than-k | Hard |
| 2485-find-the-pivot-integer | Easy |
| 2574-left-and-right-sum-differences | Easy |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0033-search-in-rotated-sorted-array | Medium |
| 0034-find-first-and-last-position-of-element-in-sorted-array | Medium |
| 0074-search-a-2d-matrix | Medium |
| 0153-find-minimum-in-rotated-sorted-array | Medium |
| 0162-find-peak-element | Medium |
| 0209-minimum-size-subarray-sum | Medium |
| 0287-find-the-duplicate-number | Medium |
| 0367-valid-perfect-square | Easy |
| 0540-single-element-in-a-sorted-array | Medium |
| 0713-subarray-product-less-than-k | Medium |
| 1004-max-consecutive-ones-iii | Medium |
| 2024-maximize-the-confusion-of-an-exam | Medium |
| 2302-count-subarrays-with-score-less-than-k | Hard |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0024-swap-nodes-in-pairs | Medium |
| 0025-reverse-nodes-in-k-group | Hard |
| 0050-powx-n | Medium |
| 0203-remove-linked-list-elements | Easy |
| 0206-reverse-linked-list | Easy |
| 0231-power-of-two | Easy |
| 0234-palindrome-linked-list | Easy |
| 0394-decode-string | Medium |
| 0509-fibonacci-number | Easy |
| 2487-remove-nodes-from-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0055-jump-game | Medium |
| 0402-remove-k-digits | Medium |
| 1846-maximum-element-after-decreasing-and-rearranging | Medium |
| 3014-minimum-number-of-pushes-to-type-word-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0031-next-permutation | Medium |
| 0061-rotate-list | Medium |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0160-intersection-of-two-linked-lists | Easy |
| 0234-palindrome-linked-list | Easy |
| 0287-find-the-duplicate-number | Medium |
| 0567-permutation-in-string | Medium |
| 0876-middle-of-the-linked-list | Easy |
| 1721-swapping-nodes-in-a-linked-list | Medium |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2396-strictly-palindromic-number | Medium |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0054-spiral-matrix | Medium |
| 1260-shift-2d-grid | Easy |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2181-merge-nodes-in-between-zeros | Medium |
| 2295-replace-elements-in-an-array | Medium |
| 3069-distribute-elements-into-two-arrays-i | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0048-rotate-image | Medium |
| 0054-spiral-matrix | Medium |
| 0073-set-matrix-zeroes | Medium |
| 0074-search-a-2d-matrix | Medium |
| 1260-shift-2d-grid | Easy |
| 1572-matrix-diagonal-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0707-design-linked-list | Medium |
| 0901-online-stock-span | Medium |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0084-largest-rectangle-in-histogram | Hard |
| 0094-binary-tree-inorder-traversal | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 0145-binary-tree-postorder-traversal | Easy |
| 0150-evaluate-reverse-polish-notation | Medium |
| 0234-palindrome-linked-list | Easy |
| 0394-decode-string | Medium |
| 0402-remove-k-digits | Medium |
| 0496-next-greater-element-i | Easy |
| 0739-daily-temperatures | Medium |
| 0901-online-stock-span | Medium |
| 0907-sum-of-subarray-minimums | Medium |
| 1019-next-greater-node-in-linked-list | Medium |
| 1475-final-prices-with-a-special-discount-in-a-shop | Easy |
| 1944-number-of-visible-people-in-a-queue | Hard |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 2487-remove-nodes-from-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0509-fibonacci-number | Easy |
| Problem Name | Difficulty |
|---|---|
| 1979-find-greatest-common-divisor-of-array | Easy |
| 2807-insert-greatest-common-divisors-in-linked-list | Medium |
| 3658-gcd-of-odd-and-even-sums | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0084-largest-rectangle-in-histogram | Hard |
| 0402-remove-k-digits | Medium |
| 0496-next-greater-element-i | Easy |
| 0739-daily-temperatures | Medium |
| 0901-online-stock-span | Medium |
| 0907-sum-of-subarray-minimums | Medium |
| 1019-next-greater-node-in-linked-list | Medium |
| 1475-final-prices-with-a-special-discount-in-a-shop | Easy |
| 1944-number-of-visible-people-in-a-queue | Hard |
| 2487-remove-nodes-from-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 1189-maximum-number-of-balloons | Easy |
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3843-first-element-with-unique-frequency | Medium |
| Problem Name | Difficulty |
|---|---|
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 2443-sum-of-number-and-its-reverse | Medium |
| 2778-sum-of-squares-of-special-elements | Easy |
| 3020-find-the-maximum-number-of-elements-in-subset | Medium |
| 3345-smallest-divisible-digit-product-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0628-maximum-product-of-three-numbers | Easy |
| 1331-rank-transform-of-an-array | Easy |
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| 1846-maximum-element-after-decreasing-and-rearranging | Medium |
| 2784-check-if-array-is-good | Easy |
| 3517-smallest-palindromic-rearrangement-i | Medium |
| 3536-maximum-product-of-two-digits | Easy |
| 3731-find-missing-elements | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 2396-strictly-palindromic-number | Medium |
| Problem Name | Difficulty |
|---|---|
| 0796-rotate-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0078-subsets | Medium |
| 0113-path-sum-ii | Medium |
| 0257-binary-tree-paths | Easy |
| 0988-smallest-string-starting-from-leaf | Medium |
| Problem Name | Difficulty |
|---|---|
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 3517-smallest-palindromic-rearrangement-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0877-stone-game | Medium |
| Problem Name | Difficulty |
|---|---|
| 0877-stone-game | Medium |
| Problem Name | Difficulty |
|---|---|
| 0877-stone-game | Medium |
| Problem Name | Difficulty |
|---|---|
| 0901-online-stock-span | Medium |
| Problem Name | Difficulty |
|---|---|
| 0084-largest-rectangle-in-histogram | Hard |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| Problem Name | Difficulty |
|---|---|
| 0584-find-customer-referee | Easy |
| 0595-big-countries | Easy |
| Problem Name | Difficulty |
|---|---|
| 0236-lowest-common-ancestor-of-a-binary-tree | Medium |
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| 1123-lowest-common-ancestor-of-deepest-leaves | Medium |
| Problem Name | Difficulty |
|---|---|
| 0236-lowest-common-ancestor-of-a-binary-tree | Medium |
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| 1123-lowest-common-ancestor-of-deepest-leaves | Medium |
| Problem Name | Difficulty |
|---|---|
| 0543-diameter-of-binary-tree | Easy |
| 0563-binary-tree-tilt | Easy |
| 0865-smallest-subtree-with-all-the-deepest-nodes | Medium |
| 1123-lowest-common-ancestor-of-deepest-leaves | Medium |