Leetcode

the algorithms c learned

LeetCode Topics

Array

Problem Name	Difficulty
0004-median-of-two-sorted-arrays	Hard
0033-search-in-rotated-sorted-array	Medium
0035-search-insert-position	Easy
0153-find-minimum-in-rotated-sorted-array	Medium
0154-find-minimum-in-rotated-sorted-array-ii	Hard
0200-number-of-islands	Medium
1306-jump-game-iii	Medium
1340-jump-game-v	Hard
1345-jump-game-iv	Hard
1665-minimum-initial-energy-to-finish-tasks	Hard
1674-minimum-moves-to-make-array-complementary	Medium
1732-find-the-highest-altitude	Easy
1752-check-if-array-is-sorted-and-rotated	Easy
1833-maximum-ice-cream-bars	Medium
1840-maximum-building-height	Hard
1846-maximum-element-after-decreasing-and-rearranging	Medium
1914-cyclically-rotating-a-grid	Medium
1967-number-of-strings-that-appear-as-substrings-in-word	Easy
1984-minimum-difference-between-highest-and-lowest-of-k-scores	Easy
2126-destroying-asteroids	Medium
2144-minimum-cost-of-buying-candies-with-discount	Easy
2161-partition-array-according-to-given-pivot	Medium
2540-minimum-common-value	Easy
2553-separate-the-digits-in-an-array	Easy
2574-left-and-right-sum-differences	Easy
2657-find-the-prefix-common-array-of-two-arrays	Medium
2770-maximum-number-of-jumps-to-reach-the-last-index	Medium
2784-check-if-array-is-good	Easy
2812-find-the-safest-path-in-a-grid	Medium
3010-divide-an-array-into-subarrays-with-minimum-cost-i	Easy
3020-find-the-maximum-number-of-elements-in-subset	Medium
3043-find-the-length-of-the-longest-common-prefix	Medium
3093-longest-common-suffix-queries	Hard
3161-block-placement-queries	Hard
3286-find-a-safe-walk-through-a-grid	Medium
3300-minimum-element-after-replacement-with-digit-sum	Easy
3379-transformed-array	Easy
3559-number-of-ways-to-assign-edge-weights-ii	Hard
3633-earliest-finish-time-for-land-and-water-rides-i	Easy
3635-earliest-finish-time-for-land-and-water-rides-ii	Medium
3689-maximum-total-subarray-value-i	Medium
3691-maximum-total-subarray-value-ii	Hard
3737-count-subarrays-with-majority-element-i	Medium
3739-count-subarrays-with-majority-element-ii	Hard
3838-weighted-word-mapping	Easy

Dynamic Programming

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
3699-number-of-zigzag-arrays-i	Hard
3700-number-of-zigzag-arrays-ii	Hard
3751-total-waviness-of-numbers-in-range-i	Medium
3753-total-waviness-of-numbers-in-range-ii	Hard

Simulation

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

Matrix

Problem Name	Difficulty
0200-number-of-islands	Medium
1914-cyclically-rotating-a-grid	Medium
2812-find-the-safest-path-in-a-grid	Medium
3286-find-a-safe-walk-through-a-grid	Medium

Shell

Problem Name	Difficulty
0194-transpose-file	Medium

Greedy

Problem Name	Difficulty
1665-minimum-initial-energy-to-finish-tasks	Hard
1833-maximum-ice-cream-bars	Medium
1846-maximum-element-after-decreasing-and-rearranging	Medium
2126-destroying-asteroids	Medium
2144-minimum-cost-of-buying-candies-with-discount	Easy
3633-earliest-finish-time-for-land-and-water-rides-i	Easy
3635-earliest-finish-time-for-land-and-water-rides-ii	Medium
3689-maximum-total-subarray-value-i	Medium
3691-maximum-total-subarray-value-ii	Hard

Sorting

Problem Name	Difficulty
1340-jump-game-v	Hard
1665-minimum-initial-energy-to-finish-tasks	Hard
1833-maximum-ice-cream-bars	Medium
1840-maximum-building-height	Hard
1846-maximum-element-after-decreasing-and-rearranging	Medium
1984-minimum-difference-between-highest-and-lowest-of-k-scores	Easy
2126-destroying-asteroids	Medium
2144-minimum-cost-of-buying-candies-with-discount	Easy
2784-check-if-array-is-good	Easy
3010-divide-an-array-into-subarrays-with-minimum-cost-i	Easy
3633-earliest-finish-time-for-land-and-water-rides-i	Easy
3635-earliest-finish-time-for-land-and-water-rides-ii	Medium

Hash Table

Problem Name	Difficulty
0013-roman-to-integer	Easy
1189-maximum-number-of-balloons	Easy
1345-jump-game-iv	Hard
1358-number-of-substrings-containing-all-three-characters	Medium
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
3020-find-the-maximum-number-of-elements-in-subset	Medium
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
3737-count-subarrays-with-majority-element-i	Medium
3739-count-subarrays-with-majority-element-ii	Hard

Prefix Sum

Problem Name	Difficulty
1674-minimum-moves-to-make-array-complementary	Medium
1732-find-the-highest-altitude	Easy
1871-jump-game-vii	Medium
2574-left-and-right-sum-differences	Easy
3699-number-of-zigzag-arrays-i	Hard
3737-count-subarrays-with-majority-element-i	Medium
3739-count-subarrays-with-majority-element-ii	Hard

Binary Search

Problem Name	Difficulty
0004-median-of-two-sorted-arrays	Hard
0033-search-in-rotated-sorted-array	Medium
0035-search-insert-position	Easy
0153-find-minimum-in-rotated-sorted-array	Medium
0154-find-minimum-in-rotated-sorted-array-ii	Hard
2540-minimum-common-value	Easy
2812-find-the-safest-path-in-a-grid	Medium
3161-block-placement-queries	Hard
3633-earliest-finish-time-for-land-and-water-rides-i	Easy
3635-earliest-finish-time-for-land-and-water-rides-ii	Medium

Divide and Conquer

Problem Name	Difficulty
0004-median-of-two-sorted-arrays	Hard
0190-reverse-bits	Easy
3737-count-subarrays-with-majority-element-i	Medium
3739-count-subarrays-with-majority-element-ii	Hard

Depth-First Search

Problem Name	Difficulty
0094-binary-tree-inorder-traversal	Easy
0100-same-tree	Easy
0101-symmetric-tree	Easy
0104-maximum-depth-of-binary-tree	Easy
0110-balanced-binary-tree	Easy
0111-minimum-depth-of-binary-tree	Easy
0112-path-sum	Easy
0144-binary-tree-preorder-traversal	Easy
0145-binary-tree-postorder-traversal	Easy
0200-number-of-islands	Medium
0226-invert-binary-tree	Easy
0257-binary-tree-paths	Easy
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

Breadth-First Search

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
0226-invert-binary-tree	Easy
1306-jump-game-iii	Medium
1345-jump-game-iv	Hard
2812-find-the-safest-path-in-a-grid	Medium
3286-find-a-safe-walk-through-a-grid	Medium

Two Pointers

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

Bit Manipulation

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

String

Problem Name	Difficulty
0013-roman-to-integer	Easy
0067-add-binary	Easy
0257-binary-tree-paths	Easy
1189-maximum-number-of-balloons	Easy
1358-number-of-substrings-containing-all-three-characters	Medium
1758-minimum-changes-to-make-alternating-binary-string	Easy
1784-check-if-binary-string-has-at-most-one-segment-of-ones	Easy
1871-jump-game-vii	Medium
1967-number-of-strings-that-appear-as-substrings-in-word	Easy
3043-find-the-length-of-the-longest-common-prefix	Medium
3093-longest-common-suffix-queries	Hard
3120-count-the-number-of-special-characters-i	Easy
3121-count-the-number-of-special-characters-ii	Medium
3612-process-string-with-special-operations-i	Medium
3838-weighted-word-mapping	Easy

Trie

Problem Name	Difficulty
3043-find-the-length-of-the-longest-common-prefix	Medium
3093-longest-common-suffix-queries	Hard

Sliding Window

Problem Name	Difficulty
1358-number-of-substrings-containing-all-three-characters	Medium
1871-jump-game-vii	Medium
1984-minimum-difference-between-highest-and-lowest-of-k-scores	Easy

Math

Problem Name	Difficulty
0013-roman-to-integer	Easy
0067-add-binary	Easy
1840-maximum-building-height	Hard
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
3700-number-of-zigzag-arrays-ii	Hard
3751-total-waviness-of-numbers-in-range-i	Medium
3753-total-waviness-of-numbers-in-range-ii	Hard

Linked List

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

Recursion

Problem Name	Difficulty
0021-merge-two-sorted-lists	Easy

Binary Indexed Tree

Problem Name	Difficulty
3161-block-placement-queries	Hard

Segment Tree

Problem Name	Difficulty
3161-block-placement-queries	Hard
3691-maximum-total-subarray-value-ii	Hard
3737-count-subarrays-with-majority-element-i	Medium
3739-count-subarrays-with-majority-element-ii	Hard

Enumeration

Problem Name	Difficulty
3010-divide-an-array-into-subarrays-with-minimum-cost-i	Easy
3020-find-the-maximum-number-of-elements-in-subset	Medium
3751-total-waviness-of-numbers-in-range-i	Medium

Heap (Priority Queue)

Problem Name	Difficulty
2812-find-the-safest-path-in-a-grid	Medium
3286-find-a-safe-walk-through-a-grid	Medium
3691-maximum-total-subarray-value-ii	Hard

Tree

Problem Name	Difficulty
0094-binary-tree-inorder-traversal	Easy
0100-same-tree	Easy
0101-symmetric-tree	Easy
0104-maximum-depth-of-binary-tree	Easy
0110-balanced-binary-tree	Easy
0111-minimum-depth-of-binary-tree	Easy
0112-path-sum	Easy
0144-binary-tree-preorder-traversal	Easy
0145-binary-tree-postorder-traversal	Easy
0226-invert-binary-tree	Easy
0257-binary-tree-paths	Easy
3558-number-of-ways-to-assign-edge-weights-i	Medium
3559-number-of-ways-to-assign-edge-weights-ii	Hard

Binary Tree

Problem Name	Difficulty
0094-binary-tree-inorder-traversal	Easy
0100-same-tree	Easy
0101-symmetric-tree	Easy
0104-maximum-depth-of-binary-tree	Easy
0110-balanced-binary-tree	Easy
0111-minimum-depth-of-binary-tree	Easy
0112-path-sum	Easy
0144-binary-tree-preorder-traversal	Easy
0145-binary-tree-postorder-traversal	Easy
0226-invert-binary-tree	Easy
0257-binary-tree-paths	Easy

Union-Find

Problem Name	Difficulty
0200-number-of-islands	Medium
2812-find-the-safest-path-in-a-grid	Medium

Stack

Problem Name	Difficulty
0094-binary-tree-inorder-traversal	Easy
0144-binary-tree-preorder-traversal	Easy
0145-binary-tree-postorder-traversal	Easy
2130-maximum-twin-sum-of-a-linked-list	Medium

Backtracking

Problem Name	Difficulty
0257-binary-tree-paths	Easy

Counting Sort

Problem Name	Difficulty
1189-maximum-number-of-balloons	Easy
1833-maximum-ice-cream-bars	Medium
3737-count-subarrays-with-majority-element-i	Medium

Merge Sort

Problem Name	Difficulty
3737-count-subarrays-with-majority-element-i	Medium
3739-count-subarrays-with-majority-element-ii	Hard

Graph Theory

Problem Name	Difficulty
3286-find-a-safe-walk-through-a-grid	Medium

Shortest Path

Problem Name	Difficulty
3286-find-a-safe-walk-through-a-grid	Medium