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

LeetCode Topics

Dynamic Programming

0042-trapping-rain-water
0124-binary-tree-maximum-path-sum
0542-01-matrix
0787-cheapest-flights-within-k-stops
0907-sum-of-subarray-minimums
1976-number-of-ways-to-arrive-at-destination

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0130-surrounded-regions
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0543-diameter-of-binary-tree
0547-number-of-provinces
0572-subtree-of-another-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0733-flood-fill
0743-network-delay-time
0778-swim-in-rising-water
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0827-making-a-large-island
0872-leaf-similar-trees
0947-most-stones-removed-with-same-row-or-column
0987-vertical-order-traversal-of-a-binary-tree
0993-cousins-in-binary-tree
1020-number-of-enclaves
1192-critical-connections-in-a-network
1319-number-of-operations-to-make-network-connected
1631-path-with-minimum-effort

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0542-01-matrix
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0733-flood-fill
0743-network-delay-time
0778-swim-in-rising-water
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0827-making-a-large-island
0958-check-completeness-of-a-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
0993-cousins-in-binary-tree
0994-rotting-oranges
1020-number-of-enclaves
1319-number-of-operations-to-make-network-connected
1631-path-with-minimum-effort
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Graph Theory

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0947-most-stones-removed-with-same-row-or-column
1192-critical-connections-in-a-network
1319-number-of-operations-to-make-network-connected
1976-number-of-ways-to-arrive-at-destination
3286-find-a-safe-walk-through-a-grid

Heap (Priority Queue)

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0621-task-scheduler
0743-network-delay-time
0778-swim-in-rising-water
0787-cheapest-flights-within-k-stops
1631-path-with-minimum-effort
1878-get-biggest-three-rhombus-sums-in-a-grid
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Shortest Path

0743-network-delay-time
0787-cheapest-flights-within-k-stops
1976-number-of-ways-to-arrive-at-destination
3286-find-a-safe-walk-through-a-grid

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0802-find-eventual-safe-states
1976-number-of-ways-to-arrive-at-destination

Array

0042-trapping-rain-water
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0130-surrounded-regions
0136-single-number
0189-rotate-array
0200-number-of-islands
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0485-max-consecutive-ones
0542-01-matrix
0621-task-scheduler
0733-flood-fill
0735-asteroid-collision
0778-swim-in-rising-water
0827-making-a-large-island
0907-sum-of-subarray-minimums
0992-subarrays-with-k-different-integers
0994-rotting-oranges
1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal
1020-number-of-enclaves
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards
1631-path-with-minimum-effort
1878-get-biggest-three-rhombus-sums-in-a-grid
2657-find-the-prefix-common-array-of-two-arrays
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3300-minimum-element-after-replacement-with-digit-sum

Binary Search

0222-count-complete-tree-nodes
0778-swim-in-rising-water
1004-max-consecutive-ones-iii
1631-path-with-minimum-effort
2812-find-the-safest-path-in-a-grid

Union-Find

0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0778-swim-in-rising-water
0785-is-graph-bipartite
0827-making-a-large-island
0947-most-stones-removed-with-same-row-or-column
1020-number-of-enclaves
1319-number-of-operations-to-make-network-connected
1631-path-with-minimum-effort
2812-find-the-safest-path-in-a-grid

Matrix

0130-surrounded-regions
0200-number-of-islands
0542-01-matrix
0733-flood-fill
0778-swim-in-rising-water
0827-making-a-large-island
0994-rotting-oranges
1020-number-of-enclaves
1631-path-with-minimum-effort
1878-get-biggest-three-rhombus-sums-in-a-grid
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Hash Table

0003-longest-substring-without-repeating-characters
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0347-top-k-frequent-elements
0424-longest-repeating-character-replacement
0621-task-scheduler
0653-two-sum-iv-input-is-a-bst
0947-most-stones-removed-with-same-row-or-column
0987-vertical-order-traversal-of-a-binary-tree
0992-subarrays-with-k-different-integers
1248-count-number-of-nice-subarrays
2657-find-the-prefix-common-array-of-two-arrays

Database

0175-combine-two-tables
0176-second-highest-salary
0180-consecutive-numbers
0185-department-top-three-salaries
0196-delete-duplicate-emails
0197-rising-temperature
0550-game-play-analysis-iv
0570-managers-with-at-least-5-direct-reports
0577-employee-bonus
0584-find-customer-referee
0585-investments-in-2016
0595-big-countries
0602-friend-requests-ii-who-has-the-most-friends
0610-triangle-judgement
0619-biggest-single-number
0620-not-boring-movies
1068-product-sales-analysis-i
1070-product-sales-analysis-iii
1075-project-employees-i
1141-user-activity-for-the-past-30-days-i
1148-article-views-i
1164-product-price-at-a-given-date
1193-monthly-transactions-i
1204-last-person-to-fit-in-the-bus
1211-queries-quality-and-percentage
1251-average-selling-price
1280-students-and-examinations
1321-restaurant-growth
1327-list-the-products-ordered-in-a-period
1378-replace-employee-id-with-the-unique-identifier
1484-group-sold-products-by-the-date
1517-find-users-with-valid-e-mails
1527-patients-with-a-condition
1581-customer-who-visited-but-did-not-make-any-transactions
1633-percentage-of-users-attended-a-contest
1661-average-time-of-process-per-machine
1683-invalid-tweets
1729-find-followers-count
1731-the-number-of-employees-which-report-to-each-employee
1757-recyclable-and-low-fat-products
1789-primary-department-for-each-employee
1907-count-salary-categories
1934-confirmation-rate
1978-employees-whose-manager-left-the-company
2356-number-of-unique-subjects-taught-by-each-teacher

Stack

0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0234-palindrome-linked-list
0402-remove-k-digits
0735-asteroid-collision
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal

Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0701-insert-into-a-binary-search-tree
0872-leaf-similar-trees
0958-check-completeness-of-a-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
0993-cousins-in-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal

Binary Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0701-insert-into-a-binary-search-tree
0872-leaf-similar-trees
0958-check-completeness-of-a-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
0993-cousins-in-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal

Bit Manipulation

0136-single-number
0222-count-complete-tree-nodes
2657-find-the-prefix-common-array-of-two-arrays

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

String Matching

0003-longest-substring-without-repeating-characters
0257-binary-tree-paths
0402-remove-k-digits
0424-longest-repeating-character-replacement
0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Backtracking

0257-binary-tree-paths

Sorting

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0621-task-scheduler
0987-vertical-order-traversal-of-a-binary-tree
1878-get-biggest-three-rhombus-sums-in-a-grid

Binary Search Tree

0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0701-insert-into-a-binary-search-tree
1008-construct-binary-search-tree-from-preorder-traversal

Monotonic Stack

0042-trapping-rain-water
0402-remove-k-digits
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal

Two Pointers

0042-trapping-rain-water
0189-rotate-array
0234-palindrome-linked-list
0653-two-sum-iv-input-is-a-bst

Linked List

0234-palindrome-linked-list

Recursion

0234-palindrome-linked-list

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements
0621-task-scheduler
0992-subarrays-with-k-different-integers

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Math

0189-rotate-array
1248-count-number-of-nice-subarrays
1878-get-biggest-three-rhombus-sums-in-a-grid
3300-minimum-element-after-replacement-with-digit-sum

Prefix Sum

1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards
1878-get-biggest-three-rhombus-sums-in-a-grid

Greedy

0402-remove-k-digits
0621-task-scheduler

Simulation

0735-asteroid-collision

Sliding Window

0003-longest-substring-without-repeating-characters
0424-longest-repeating-character-replacement
0992-subarrays-with-k-different-integers
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards

Biconnected Component

1192-critical-connections-in-a-network