Dynamic-programming-practice

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

Math

0096-unique-binary-search-trees
0633-sum-of-square-numbers
1370-count-number-of-nice-subarrays

Dynamic Programming

0096-unique-binary-search-trees
0312-burst-balloons
0542-01-matrix
1475-maximum-sum-bst-in-binary-tree
1669-minimum-cost-to-cut-a-stick
3403-minimum-substring-partition-of-equal-character-frequency

Tree

0096-unique-binary-search-trees
0101-symmetric-tree
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0513-find-bottom-left-tree-value
0538-convert-bst-to-greater-tree
0662-maximum-width-of-binary-tree
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
1114-binary-search-tree-to-greater-sum-tree
1285-balance-a-binary-search-tree
1475-maximum-sum-bst-in-binary-tree
2384-root-equals-sum-of-children

Binary Search Tree

0096-unique-binary-search-trees
0222-count-complete-tree-nodes
0538-convert-bst-to-greater-tree
0633-sum-of-square-numbers
0853-most-profit-assigning-work
1050-construct-binary-search-tree-from-preorder-traversal
1114-binary-search-tree-to-greater-sum-tree
1285-balance-a-binary-search-tree
1475-maximum-sum-bst-in-binary-tree
1605-minimum-number-of-days-to-make-m-bouquets
1675-magnetic-force-between-two-balls
3419-maximum-points-inside-the-square
3427-special-array-ii

Binary Tree

0096-unique-binary-search-trees
0101-symmetric-tree
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0513-find-bottom-left-tree-value
0538-convert-bst-to-greater-tree
0662-maximum-width-of-binary-tree
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
1114-binary-search-tree-to-greater-sum-tree
1285-balance-a-binary-search-tree
1475-maximum-sum-bst-in-binary-tree
2384-root-equals-sum-of-children

Two Pointers

0344-reverse-string
0633-sum-of-square-numbers
0853-most-profit-assigning-work
2572-append-characters-to-string-to-make-subsequence

String

0344-reverse-string
0409-longest-palindrome
0648-replace-words
1044-find-common-characters
2572-append-characters-to-string-to-make-subsequence
3403-minimum-substring-partition-of-equal-character-frequency
3419-maximum-points-inside-the-square
3445-lexicographically-minimum-string-after-removing-stars

Greedy

0409-longest-palindrome
0502-ipo
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1285-balance-a-binary-search-tree
2148-minimum-number-of-moves-to-seat-everyone
2379-maximum-total-importance-of-roads
2572-append-characters-to-string-to-make-subsequence
3445-lexicographically-minimum-string-after-removing-stars

Array

0130-surrounded-regions
0200-number-of-islands
0312-burst-balloons
0502-ipo
0542-01-matrix
0648-replace-words
0733-flood-fill
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1016-subarray-sums-divisible-by-k
1036-rotting-oranges
1037-minimum-number-of-k-consecutive-bit-flips
1044-find-common-characters
1050-construct-binary-search-tree-from-preorder-traversal
1073-number-of-enclaves
1138-grumpy-bookstore-owner
1217-relative-sort-array
1370-count-number-of-nice-subarrays
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1605-minimum-number-of-days-to-make-m-bouquets
1669-minimum-cost-to-cut-a-stick
1675-magnetic-force-between-two-balls
2148-minimum-number-of-moves-to-seat-everyone
3415-check-if-grid-satisfies-conditions
3419-maximum-points-inside-the-square
3427-special-array-ii
3430-count-days-without-meetings

Sorting

0502-ipo
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1029-vertical-order-traversal-of-a-binary-tree
1217-relative-sort-array
1669-minimum-cost-to-cut-a-stick
1675-magnetic-force-between-two-balls
2148-minimum-number-of-moves-to-seat-everyone
2379-maximum-total-importance-of-roads
3419-maximum-points-inside-the-square
3430-count-days-without-meetings

Hash Table

0409-longest-palindrome
0648-replace-words
0876-hand-of-straights
0893-all-nodes-distance-k-in-binary-tree
1016-subarray-sums-divisible-by-k
1029-vertical-order-traversal-of-a-binary-tree
1044-find-common-characters
1217-relative-sort-array
1370-count-number-of-nice-subarrays
3403-minimum-substring-partition-of-equal-character-frequency
3419-maximum-points-inside-the-square
3445-lexicographically-minimum-string-after-removing-stars

Stack

1050-construct-binary-search-tree-from-preorder-traversal
3445-lexicographically-minimum-string-after-removing-stars

Heap (Priority Queue)

0502-ipo
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
2379-maximum-total-importance-of-roads
3445-lexicographically-minimum-string-after-removing-stars

Trie

0648-replace-words

Prefix Sum

1016-subarray-sums-divisible-by-k
1037-minimum-number-of-k-consecutive-bit-flips
3427-special-array-ii

Matrix

0130-surrounded-regions
0200-number-of-islands
0542-01-matrix
0733-flood-fill
1036-rotting-oranges
1073-number-of-enclaves
3415-check-if-grid-satisfies-conditions

Counting

3403-minimum-substring-partition-of-equal-character-frequency

Bit Manipulation

0222-count-complete-tree-nodes
1037-minimum-number-of-k-consecutive-bit-flips

Counting Sort

0982-minimum-increment-to-make-array-unique
1217-relative-sort-array

Depth-First Search

0101-symmetric-tree
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0513-find-bottom-left-tree-value
0538-convert-bst-to-greater-tree
0547-number-of-provinces
0662-maximum-width-of-binary-tree
0733-flood-fill
0801-is-graph-bipartite
0820-find-eventual-safe-states
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1073-number-of-enclaves
1114-binary-search-tree-to-greater-sum-tree
1285-balance-a-binary-search-tree
1475-maximum-sum-bst-in-binary-tree

Breadth-First Search

0101-symmetric-tree
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0513-find-bottom-left-tree-value
0542-01-matrix
0547-number-of-provinces
0662-maximum-width-of-binary-tree
0733-flood-fill
0801-is-graph-bipartite
0820-find-eventual-safe-states
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1036-rotting-oranges
1073-number-of-enclaves

Sliding Window

1037-minimum-number-of-k-consecutive-bit-flips
1138-grumpy-bookstore-owner
1370-count-number-of-nice-subarrays
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Monotonic Stack

1050-construct-binary-search-tree-from-preorder-traversal

Queue

1037-minimum-number-of-k-consecutive-bit-flips
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Ordered Set

1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Monotonic Queue

1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Union Find

0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0801-is-graph-bipartite
1073-number-of-enclaves

Graph

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0801-is-graph-bipartite
0820-find-eventual-safe-states
1916-find-center-of-star-graph
2379-maximum-total-importance-of-roads

Divide and Conquer

1285-balance-a-binary-search-tree

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0820-find-eventual-safe-states

LeetCode Topics

Hash Table

0003-longest-substring-without-repeating-characters
0073-set-matrix-zeroes
0076-minimum-window-substring
0127-word-ladder
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0350-intersection-of-two-arrays-ii
0424-longest-repeating-character-replacement
0721-accounts-merge
0726-number-of-atoms
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
0984-most-stones-removed-with-same-row-or-column
1023-time-based-key-value-store
1029-vertical-order-traversal-of-a-binary-tree
1034-subarrays-with-k-different-integers
1207-delete-nodes-and-return-forest
1249-snapshot-array
1460-number-of-substrings-containing-all-three-characters
2306-create-binary-tree-from-descriptions

String

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0127-word-ladder
0424-longest-repeating-character-replacement
0721-accounts-merge
0726-number-of-atoms
1023-time-based-key-value-store
1298-reverse-substrings-between-each-pair-of-parentheses
1460-number-of-substrings-containing-all-three-characters
1720-crawler-log-folder
1756-minimum-deletions-to-make-string-balanced
1818-maximum-score-from-removing-substrings
2727-number-of-senior-citizens
2736-minimum-additions-to-make-valid-string
3235-minimum-cost-to-convert-string-i

Breadth-First Search

0103-binary-tree-zigzag-level-order-traversal
0127-word-ladder
0547-number-of-provinces
0721-accounts-merge
0803-cheapest-flights-within-k-stops
0854-making-a-large-island
0871-keys-and-rooms
1029-vertical-order-traversal-of-a-binary-tree
1036-rotting-oranges
1171-shortest-path-in-binary-matrix
1229-shortest-path-with-alternating-colors
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected
1753-path-with-minimum-effort
2171-second-minimum-time-to-reach-destination

Depth-First Search

0547-number-of-provinces
0721-accounts-merge
0803-cheapest-flights-within-k-stops
0854-making-a-large-island
0871-keys-and-rooms
0984-most-stones-removed-with-same-row-or-column
1029-vertical-order-traversal-of-a-binary-tree
1207-delete-nodes-and-return-forest
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected
1653-number-of-good-leaf-nodes-pairs
1753-path-with-minimum-effort
2739-minimize-the-total-price-of-the-trips

Graph

0547-number-of-provinces
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms
0984-most-stones-removed-with-same-row-or-column
1229-shortest-path-with-alternating-colors
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
1706-min-cost-to-connect-all-points
2090-number-of-ways-to-arrive-at-destination
2171-second-minimum-time-to-reach-destination
2472-build-a-matrix-with-conditions
2739-minimize-the-total-price-of-the-trips
3235-minimum-cost-to-convert-string-i

Topological Sort

1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
2090-number-of-ways-to-arrive-at-destination
2472-build-a-matrix-with-conditions

Array

0004-median-of-two-sorted-arrays
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0045-jump-game-ii
0048-rotate-image
0053-maximum-subarray
0055-jump-game
0056-merge-intervals
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
0081-search-in-rotated-sorted-array-ii
0088-merge-sorted-array
0121-best-time-to-buy-and-sell-stock
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0240-search-a-2d-matrix-ii
0275-h-index-ii
0350-intersection-of-two-arrays-ii
0410-split-array-largest-sum
0540-single-element-in-a-sorted-array
0658-find-k-closest-elements
0713-subarray-product-less-than-k
0721-accounts-merge
0745-find-smallest-letter-greater-than-target
0854-making-a-large-island
0882-peak-index-in-a-mountain-array
0890-lemonade-change
0907-koko-eating-bananas
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1036-rotting-oranges
1046-max-consecutive-ones-iii
1056-capacity-to-ship-packages-within-d-days
1171-shortest-path-in-binary-matrix
1196-filling-bookcase-shelves
1207-delete-nodes-and-return-forest
1249-snapshot-array
1293-three-consecutive-odds
1408-find-the-smallest-divisor-given-a-threshold
1496-lucky-numbers-in-a-matrix
1605-minimum-number-of-days-to-make-m-bouquets
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1646-kth-missing-positive-number
1706-min-cost-to-connect-all-points
1720-crawler-log-folder
1753-path-with-minimum-effort
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2255-minimum-swaps-to-group-all-1s-together-ii
2306-create-binary-tree-from-descriptions
2394-count-subarrays-with-score-less-than-k
2472-build-a-matrix-with-conditions
2727-number-of-senior-citizens
2739-minimize-the-total-price-of-the-trips
3235-minimum-cost-to-convert-string-i
3383-taking-maximum-energy-from-the-mystic-dungeon
3429-special-array-i
3469-maximum-height-of-a-triangle

Prefix Sum

0410-split-array-largest-sum
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
2394-count-subarrays-with-score-less-than-k
3383-taking-maximum-energy-from-the-mystic-dungeon

Union Find

0547-number-of-provinces
0721-accounts-merge
0854-making-a-large-island
0984-most-stones-removed-with-same-row-or-column
1442-number-of-operations-to-make-network-connected
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
1706-min-cost-to-connect-all-points
1753-path-with-minimum-effort

Matrix

0048-rotate-image
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0240-search-a-2d-matrix-ii
0854-making-a-large-island
1036-rotting-oranges
1171-shortest-path-in-binary-matrix
1496-lucky-numbers-in-a-matrix
1753-path-with-minimum-effort
2472-build-a-matrix-with-conditions

Binary Search

0004-median-of-two-sorted-arrays
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0240-search-a-2d-matrix-ii
0275-h-index-ii
0350-intersection-of-two-arrays-ii
0410-split-array-largest-sum
0540-single-element-in-a-sorted-array
0658-find-k-closest-elements
0745-find-smallest-letter-greater-than-target
0882-peak-index-in-a-mountain-array
0907-koko-eating-bananas
1023-time-based-key-value-store
1046-max-consecutive-ones-iii
1056-capacity-to-ship-packages-within-d-days
1249-snapshot-array
1408-find-the-smallest-divisor-given-a-threshold
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number
1753-path-with-minimum-effort
2394-count-subarrays-with-score-less-than-k

Heap (Priority Queue)

0658-find-k-closest-elements
0803-cheapest-flights-within-k-stops
1753-path-with-minimum-effort

Dynamic Programming

0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0121-best-time-to-buy-and-sell-stock
0410-split-array-largest-sum
0803-cheapest-flights-within-k-stops
1196-filling-bookcase-shelves
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1756-minimum-deletions-to-make-string-balanced
2090-number-of-ways-to-arrive-at-destination
2736-minimum-additions-to-make-valid-string
2739-minimize-the-total-price-of-the-trips

Shortest Path

0803-cheapest-flights-within-k-stops
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination
2171-second-minimum-time-to-reach-destination
3235-minimum-cost-to-convert-string-i

Two Pointers

0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0061-rotate-list
0075-sort-colors
0088-merge-sorted-array
0141-linked-list-cycle
0350-intersection-of-two-arrays-ii
0658-find-k-closest-elements
0908-middle-of-the-linked-list
2216-delete-the-middle-node-of-a-linked-list

Sorting

0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0350-intersection-of-two-arrays-ii
0658-find-k-closest-elements
0721-accounts-merge
0726-number-of-atoms
1029-vertical-order-traversal-of-a-binary-tree
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves

Greedy

0045-jump-game-ii
0055-jump-game
0410-split-array-largest-sum
0890-lemonade-change
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1818-maximum-score-from-removing-substrings
2736-minimum-additions-to-make-valid-string

Minimum Spanning Tree

1706-min-cost-to-connect-all-points

Linked List

0019-remove-nth-node-from-end-of-list
0025-reverse-nodes-in-k-group
0061-rotate-list
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0206-reverse-linked-list
0328-odd-even-linked-list
0908-middle-of-the-linked-list
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2216-delete-the-middle-node-of-a-linked-list
2299-merge-nodes-in-between-zeros

Simulation

1642-water-bottles
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2299-merge-nodes-in-between-zeros
2645-pass-the-pillow

Enumeration

3469-maximum-height-of-a-triangle

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0424-longest-repeating-character-replacement
0658-find-k-closest-elements
0713-subarray-product-less-than-k
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1046-max-consecutive-ones-iii
1460-number-of-substrings-containing-all-three-characters
2255-minimum-swaps-to-group-all-1s-together-ii
2394-count-subarrays-with-score-less-than-k

Math

0048-rotate-image
1642-water-bottles
1951-find-the-winner-of-the-circular-game
2645-pass-the-pillow

Counting

1034-subarrays-with-k-different-integers

Divide and Conquer

0004-median-of-two-sorted-arrays
0053-maximum-subarray
0240-search-a-2d-matrix-ii

Recursion

0025-reverse-nodes-in-k-group
0206-reverse-linked-list
1951-find-the-winner-of-the-circular-game

Queue

1951-find-the-winner-of-the-circular-game

Stack

0726-number-of-atoms
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1756-minimum-deletions-to-make-string-balanced
1818-maximum-score-from-removing-substrings
2736-minimum-additions-to-make-valid-string

Tree

0103-binary-tree-zigzag-level-order-traversal
1029-vertical-order-traversal-of-a-binary-tree
1207-delete-nodes-and-return-forest
1653-number-of-good-leaf-nodes-pairs
2306-create-binary-tree-from-descriptions
2739-minimize-the-total-price-of-the-trips

Binary Tree

0103-binary-tree-zigzag-level-order-traversal
1029-vertical-order-traversal-of-a-binary-tree
1207-delete-nodes-and-return-forest
1653-number-of-good-leaf-nodes-pairs
2306-create-binary-tree-from-descriptions

Database

0584-find-customer-referee
0610-triangle-judgement
1135-customers-who-bought-all-products
1155-product-sales-analysis-iii
1245-user-activity-for-the-past-30-days-i
1258-article-views-i
1292-immediate-food-delivery-ii
1317-monthly-transactions-i
1509-replace-employee-id-with-the-unique-identifier
1801-average-time-of-process-per-machine
1827-invalid-tweets
1908-recyclable-and-low-fat-products
2495-number-of-unique-subjects-taught-by-each-teacher

Design

1023-time-based-key-value-store
1249-snapshot-array