My LeetCode submitted solutions (code only).
| Problem Name | Difficulty |
|---|---|
| 0010-regular-expression-matching | Hard |
| 0021-merge-two-sorted-lists | Easy |
| 0024-swap-nodes-in-pairs | Medium |
| 0025-reverse-nodes-in-k-group | Hard |
| 0486-predict-the-winner | Medium |
| 1545-find-kth-bit-in-nth-binary-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0043-multiply-strings | Medium |
| 0059-spiral-matrix-ii | Medium |
| 0067-add-binary | Easy |
| 0289-game-of-life | Medium |
| 0657-robot-return-to-origin | Easy |
| 0874-walking-robot-simulation | Medium |
| 1260-shift-2d-grid | Easy |
| 1545-find-kth-bit-in-nth-binary-string | Medium |
| 1914-cyclically-rotating-a-grid | Medium |
| 2069-walking-robot-simulation-ii | Medium |
| 2075-decode-the-slanted-ciphertext | Medium |
| 2154-keep-multiplying-found-values-by-two | Easy |
| 2553-separate-the-digits-in-an-array | Easy |
| 2946-matrix-similarity-after-cyclic-shifts | Easy |
| 3379-transformed-array | Easy |
| 3433-count-mentions-per-user | Medium |
| 3653-xor-after-range-multiplication-queries-i | Medium |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 1358-number-of-substrings-containing-all-three-characters | Medium |
| 1888-minimum-number-of-flips-to-make-the-binary-string-alternating | Medium |
| 3634-minimum-removals-to-balance-array | Medium |
| Problem Name | Difficulty |
|---|---|
| 0017-letter-combinations-of-a-phone-number | Medium |
| 0022-generate-parentheses | Medium |
| 0037-sudoku-solver | Hard |
| 0039-combination-sum | Medium |
| 0040-combination-sum-ii | Medium |
| 0046-permutations | Medium |
| 0077-combinations | Medium |
| 0078-subsets | Medium |
| 0079-word-search | Medium |
| 0089-gray-code | Medium |
| 0093-restore-ip-addresses | Medium |
| 0095-unique-binary-search-trees-ii | Medium |
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n | Medium |
| 1980-find-unique-binary-string | Medium |
| 2044-count-number-of-maximum-bitwise-or-subsets | Medium |
| 3348-smallest-divisible-digit-product-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0079-word-search | Medium |
| 0094-binary-tree-inorder-traversal | Easy |
| 0099-recover-binary-search-tree | Medium |
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0110-balanced-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 0430-flatten-a-multilevel-doubly-linked-list | Medium |
| 1306-jump-game-iii | Medium |
| 1382-balance-a-binary-search-tree | Medium |
| 1559-detect-cycles-in-2d-grid | Medium |
| 1722-minimize-hamming-distance-after-swap-operations | Medium |
| 2092-find-all-people-with-secret | Hard |
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 2685-count-the-number-of-complete-components | Medium |
| 3310-remove-methods-from-project | Medium |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 1306-jump-game-iii | Medium |
| 1345-jump-game-iv | Hard |
| 1559-detect-cycles-in-2d-grid | Medium |
| 2092-find-all-people-with-secret | Hard |
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 2685-count-the-number-of-complete-components | Medium |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3310-remove-methods-from-project | Medium |
| Problem Name | Difficulty |
|---|---|
| 1559-detect-cycles-in-2d-grid | Medium |
| 1722-minimize-hamming-distance-after-swap-operations | Medium |
| 2092-find-all-people-with-secret | Hard |
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 2685-count-the-number-of-complete-components | Medium |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 2092-find-all-people-with-secret | Hard |
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 2685-count-the-number-of-complete-components | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3310-remove-methods-from-project | Medium |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0015-3sum | Medium |
| 0016-3sum-closest | Medium |
| 0018-4sum | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0031-next-permutation | Medium |
| 0061-rotate-list | Medium |
| 0075-sort-colors | Medium |
| 0080-remove-duplicates-from-sorted-array-ii | Medium |
| 0086-partition-list | Medium |
| 0125-valid-palindrome | Easy |
| 1855-maximum-distance-between-a-pair-of-values | Medium |
| 1861-rotating-the-box | Medium |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 2396-strictly-palindromic-number | Medium |
| 2540-minimum-common-value | Easy |
| 3302-find-the-lexicographically-smallest-valid-sequence | Medium |
| 3633-earliest-finish-time-for-land-and-water-rides-i | Easy |
| 3643-flip-square-submatrix-vertically | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0029-divide-two-integers | Medium |
| 0067-add-binary | Easy |
| 0078-subsets | Medium |
| 0089-gray-code | Medium |
| 1009-complement-of-base-10-integer | Easy |
| 2044-count-number-of-maximum-bitwise-or-subsets | Medium |
| 3513-number-of-unique-xor-triplets-i | Medium |
| 3514-number-of-unique-xor-triplets-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 1291-sequential-digits | Medium |
| 1925-count-square-sum-triples | Easy |
| 2044-count-number-of-maximum-bitwise-or-subsets | Medium |
| 3234-count-the-number-of-substrings-with-dominant-ones | Medium |
| 3345-smallest-divisible-digit-product-i | Easy |
| 3514-number-of-unique-xor-triplets-ii | Medium |
| 3546-equal-sum-grid-partition-i | Medium |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0169-majority-element | Easy |
| 1189-maximum-number-of-balloons | Easy |
| 2148-count-elements-with-strictly-smaller-and-greater-elements | Easy |
| 2833-furthest-point-from-origin | Easy |
| 3016-minimum-number-of-pushes-to-type-word-ii | Medium |
| 3312-sorted-gcd-pair-queries | Hard |
| 3583-count-special-triplets | Medium |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0796-rotate-string | Easy |
| 3474-lexicographically-smallest-generated-string | Hard |
| Problem Name | Difficulty |
|---|---|
| 1979-find-greatest-common-divisor-of-array | Easy |
| 2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1 | Medium |
| 3312-sorted-gcd-pair-queries | Hard |
| 3348-smallest-divisible-digit-product-ii | Hard |
| 3658-gcd-of-odd-and-even-sums | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0021-merge-two-sorted-lists | Easy |
| 0024-swap-nodes-in-pairs | Medium |
| 0025-reverse-nodes-in-k-group | Hard |
| 0061-rotate-list | Medium |
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0086-partition-list | Medium |
| 0092-reverse-linked-list-ii | Medium |
| 0147-insertion-sort-list | Medium |
| 0430-flatten-a-multilevel-doubly-linked-list | Medium |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0430-flatten-a-multilevel-doubly-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 2396-strictly-palindromic-number | Medium |
| Problem Name | Difficulty |
|---|---|
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| 1878-get-biggest-three-rhombus-sums-in-a-grid | Medium |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero | Medium |
| Problem Name | Difficulty |
|---|---|
| 1140-stone-game-ii | Medium |
| 1674-minimum-moves-to-make-array-complementary | Medium |
| 1732-find-the-highest-altitude | Easy |
| 1878-get-biggest-three-rhombus-sums-in-a-grid | Medium |
| 2574-left-and-right-sum-differences | Easy |
| 2615-sum-of-distances | Medium |
| 2906-construct-product-matrix | Medium |
| 3212-count-submatrices-with-equal-frequency-of-x-and-y | Medium |
| 3312-sorted-gcd-pair-queries | Hard |
| 3546-equal-sum-grid-partition-i | Medium |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0094-binary-tree-inorder-traversal | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 1081-smallest-subsequence-of-distinct-characters | Medium |
| 1653-minimum-deletions-to-make-string-balanced | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0175-combine-two-tables | Easy |
| 0176-second-highest-salary | Medium |
| 0177-nth-highest-salary | Medium |
| 0181-employees-earning-more-than-their-managers | Easy |
| 0183-customers-who-never-order | Easy |
| 0196-delete-duplicate-emails | Easy |
| Problem Name | Difficulty |
|---|---|
| 2069-walking-robot-simulation-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0053-maximum-subarray | Medium |
| 0169-majority-element | Easy |
| 1382-balance-a-binary-search-tree | Medium |
| 3653-xor-after-range-multiplication-queries-i | Medium |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0095-unique-binary-search-trees-ii | Medium |
| 0096-unique-binary-search-trees | Medium |
| 0099-recover-binary-search-tree | Medium |
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0110-balanced-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 1382-balance-a-binary-search-tree | Medium |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0095-unique-binary-search-trees-ii | Medium |
| 0096-unique-binary-search-trees | Medium |
| 0099-recover-binary-search-tree | Medium |
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0110-balanced-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 1382-balance-a-binary-search-tree | Medium |
| Problem Name | Difficulty |
|---|---|
| 2452-words-within-two-edits-of-dictionary | Medium |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| Problem Name | Difficulty |
|---|---|
| 1266-minimum-time-visiting-all-points | Easy |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| Problem Name | Difficulty |
|---|---|
| 0095-unique-binary-search-trees-ii | Medium |
| 0096-unique-binary-search-trees | Medium |
| 0099-recover-binary-search-tree | Medium |
| 1382-balance-a-binary-search-tree | 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 |
|---|---|
| 3286-find-a-safe-walk-through-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 3312-sorted-gcd-pair-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 1081-smallest-subsequence-of-distinct-characters | Medium |
| Problem Name | Difficulty |
|---|---|
| 3517-smallest-palindromic-rearrangement-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0486-predict-the-winner | Medium |
| 0877-stone-game | Medium |
| 1140-stone-game-ii | Medium |
| 1406-stone-game-iii | Hard |
| Problem Name | Difficulty |
|---|---|
| 1140-stone-game-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 1140-stone-game-ii | Medium |