Practice DSA Daily
| Problem Name | Difficulty |
|---|---|
| 0001-two-sum | Easy |
| 0003-longest-substring-without-repeating-characters | Medium |
| 0073-set-matrix-zeroes | Medium |
| 0128-longest-consecutive-sequence | Medium |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0424-longest-repeating-character-replacement | Medium |
| 0454-4sum-ii | Medium |
| 0523-continuous-subarray-sum | Medium |
| 0560-subarray-sum-equals-k | Medium |
| 0904-fruit-into-baskets | Medium |
| 0930-binary-subarrays-with-sum | Medium |
| 0987-vertical-order-traversal-of-a-binary-tree | Hard |
| 1248-count-number-of-nice-subarrays | Medium |
| 1331-rank-transform-of-an-array | Easy |
| 1358-number-of-substrings-containing-all-three-characters | Medium |
| 1995-count-special-quadruplets | Easy |
| 3312-sorted-gcd-pair-queries | Hard |
| 3532-path-existence-queries-in-a-graph-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0003-longest-substring-without-repeating-characters | Medium |
| 0424-longest-repeating-character-replacement | Medium |
| 0904-fruit-into-baskets | Medium |
| 0930-binary-subarrays-with-sum | Medium |
| 1248-count-number-of-nice-subarrays | Medium |
| 1358-number-of-substrings-containing-all-three-characters | Medium |
| Problem Name | Difficulty |
|---|---|
| 0523-continuous-subarray-sum | Medium |
| 0560-subarray-sum-equals-k | Medium |
| 0930-binary-subarrays-with-sum | Medium |
| 1248-count-number-of-nice-subarrays | Medium |
| 3312-sorted-gcd-pair-queries | Hard |
| 3756-concatenate-non-zero-digits-and-multiply-by-sum-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0015-3sum | Medium |
| 0018-4sum | Medium |
| 0026-remove-duplicates-from-sorted-array | Easy |
| 0088-merge-sorted-array | Easy |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0234-palindrome-linked-list | Easy |
| 0455-assign-cookies | Easy |
| 0876-middle-of-the-linked-list | Easy |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2410-maximum-matching-of-players-with-trainers | Medium |
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0045-jump-game-ii | Medium |
| 0055-jump-game | Medium |
| 0135-candy | Hard |
| 0435-non-overlapping-intervals | Medium |
| 0455-assign-cookies | Easy |
| 0678-valid-parenthesis-string | Medium |
| 0860-lemonade-change | Easy |
| 1081-smallest-subsequence-of-distinct-characters | Medium |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 2410-maximum-matching-of-players-with-trainers | Medium |
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0015-3sum | Medium |
| 0018-4sum | Medium |
| 0056-merge-intervals | Medium |
| 0088-merge-sorted-array | Easy |
| 0435-non-overlapping-intervals | Medium |
| 0455-assign-cookies | Easy |
| 0987-vertical-order-traversal-of-a-binary-tree | Hard |
| 1288-remove-covered-intervals | Medium |
| 1331-rank-transform-of-an-array | Easy |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 2410-maximum-matching-of-players-with-trainers | Medium |
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0045-jump-game-ii | Medium |
| 0055-jump-game | Medium |
| 0124-binary-tree-maximum-path-sum | Hard |
| 0435-non-overlapping-intervals | Medium |
| 0678-valid-parenthesis-string | Medium |
| 1301-number-of-paths-with-max-score | Hard |
| 3336-find-the-number-of-subsequences-with-equal-gcd | Hard |
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| 3620-network-recovery-pathways | Hard |
| 3753-total-waviness-of-numbers-in-range-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0094-binary-tree-inorder-traversal | Easy |
| 0144-binary-tree-preorder-traversal | Easy |
| 0145-binary-tree-postorder-traversal | Easy |
| 0155-min-stack | Medium |
| 0225-implement-stack-using-queues | Easy |
| 0232-implement-queue-using-stacks | Easy |
| 0234-palindrome-linked-list | Easy |
| 0678-valid-parenthesis-string | Medium |
| 1081-smallest-subsequence-of-distinct-characters | Medium |
| Problem Name | Difficulty |
|---|---|
| 0128-longest-consecutive-sequence | Medium |
| 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 |
| 3532-path-existence-queries-in-a-graph-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0048-rotate-image | Medium |
| 0054-spiral-matrix | Medium |
| 0059-spiral-matrix-ii | Medium |
| 0073-set-matrix-zeroes | Medium |
| 1301-number-of-paths-with-max-score | Hard |
| 1886-determine-whether-matrix-can-be-obtained-by-rotation | Easy |
| 2326-spiral-matrix-iv | Medium |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3417-zigzag-grid-traversal-with-skip | Easy |
| Problem Name | Difficulty |
|---|---|
| 0054-spiral-matrix | Medium |
| 0059-spiral-matrix-ii | Medium |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2326-spiral-matrix-iv | Medium |
| 3417-zigzag-grid-traversal-with-skip | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | Medium |
| 0206-reverse-linked-list | Easy |
| 0234-palindrome-linked-list | Easy |
| 0237-delete-node-in-a-linked-list | Medium |
| 0876-middle-of-the-linked-list | Easy |
| 2326-spiral-matrix-iv | Medium |
| Problem Name | Difficulty |
|---|---|
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3312-sorted-gcd-pair-queries | Hard |
| 3532-path-existence-queries-in-a-graph-i | Medium |
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0102-binary-tree-level-order-traversal | Medium |
| 0103-binary-tree-zigzag-level-order-traversal | Medium |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0199-binary-tree-right-side-view | Medium |
| 0662-maximum-width-of-binary-tree | Medium |
| 0987-vertical-order-traversal-of-a-binary-tree | 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 |
| Problem Name | Difficulty |
|---|---|
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 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 |
| 3532-path-existence-queries-in-a-graph-i | Medium |
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 0155-min-stack | Medium |
| 0225-implement-stack-using-queues | Easy |
| 0232-implement-queue-using-stacks | Easy |
| Problem Name | Difficulty |
|---|---|
| 0225-implement-stack-using-queues | Easy |
| 0232-implement-queue-using-stacks | Easy |
| Problem Name | Difficulty |
|---|---|
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 0206-reverse-linked-list | Easy |
| 0234-palindrome-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 1291-sequential-digits | Medium |
| 1995-count-special-quadruplets | Easy |
| Problem Name | Difficulty |
|---|---|
| 0572-subtree-of-another-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0572-subtree-of-another-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 3534-path-existence-queries-in-a-graph-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 1979-find-greatest-common-divisor-of-array | Easy |
| 3312-sorted-gcd-pair-queries | Hard |
| 3336-find-the-number-of-subsequences-with-equal-gcd | Hard |
| 3658-gcd-of-odd-and-even-sums | Easy |
| 3867-sum-of-gcd-of-formed-pairs | Medium |
| Problem Name | Difficulty |
|---|---|
| 3312-sorted-gcd-pair-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 3312-sorted-gcd-pair-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 1081-smallest-subsequence-of-distinct-characters | Medium |