the algorithms c learned
| Problem Name | Difficulty |
|---|---|
| 1340-jump-game-v | Hard |
| 1871-jump-game-vii | Medium |
| 2770-maximum-number-of-jumps-to-reach-the-last-index | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| 3753-total-waviness-of-numbers-in-range-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0067-add-binary | Easy |
| 1914-cyclically-rotating-a-grid | Medium |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2553-separate-the-digits-in-an-array | Easy |
| 3379-transformed-array | Easy |
| 3612-process-string-with-special-operations-i | Medium |
| 3838-weighted-word-mapping | Easy |
| Problem Name | Difficulty |
|---|---|
| 0200-number-of-islands | Medium |
| 1914-cyclically-rotating-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0194-transpose-file | Medium |
| Problem Name | Difficulty |
|---|---|
| 0013-roman-to-integer | Easy |
| 1345-jump-game-iv | Hard |
| 1674-minimum-moves-to-make-array-complementary | Medium |
| 2540-minimum-common-value | Easy |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| 2784-check-if-array-is-good | Easy |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| 3120-count-the-number-of-special-characters-i | Easy |
| 3121-count-the-number-of-special-characters-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 1674-minimum-moves-to-make-array-complementary | Medium |
| 1871-jump-game-vii | Medium |
| 2574-left-and-right-sum-differences | Easy |
| Problem Name | Difficulty |
|---|---|
| 0004-median-of-two-sorted-arrays | Hard |
| 0190-reverse-bits | Easy |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0200-number-of-islands | Medium |
| 1306-jump-game-iii | Medium |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 0200-number-of-islands | Medium |
| 1306-jump-game-iii | Medium |
| 1345-jump-game-iv | Hard |
| Problem Name | Difficulty |
|---|---|
| 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 |
| 2540-minimum-common-value | Easy |
| 3633-earliest-finish-time-for-land-and-water-rides-i | Easy |
| 3635-earliest-finish-time-for-land-and-water-rides-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0067-add-binary | Easy |
| 0190-reverse-bits | Easy |
| 0693-binary-number-with-alternating-bits | Easy |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| 3093-longest-common-suffix-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 1871-jump-game-vii | Medium |
| 1984-minimum-difference-between-highest-and-lowest-of-k-scores | Easy |
| Problem Name | Difficulty |
|---|---|
| 0013-roman-to-integer | Easy |
| 0067-add-binary | Easy |
| 3300-minimum-element-after-replacement-with-digit-sum | Easy |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| 3753-total-waviness-of-numbers-in-range-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| Problem Name | Difficulty |
|---|---|
| 3161-block-placement-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 3161-block-placement-queries | Hard |
| 3691-maximum-total-subarray-value-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3010-divide-an-array-into-subarrays-with-minimum-cost-i | Easy |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 3691-maximum-total-subarray-value-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 0100-same-tree | Easy |
| 0101-symmetric-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0200-number-of-islands | Medium |
| Problem Name | Difficulty |
|---|---|
| 0094-binary-tree-inorder-traversal | Easy |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |