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

LeetCode Topics

Dynamic Programming

0787-cheapest-flights-within-k-stops
1976-number-of-ways-to-arrive-at-destination

Depth-First Search

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0543-diameter-of-binary-tree
0743-network-delay-time
0778-swim-in-rising-water
0787-cheapest-flights-within-k-stops
0947-most-stones-removed-with-same-row-or-column
1319-number-of-operations-to-make-network-connected

Breadth-First Search

0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0743-network-delay-time
0778-swim-in-rising-water
0787-cheapest-flights-within-k-stops
0958-check-completeness-of-a-binary-tree
1319-number-of-operations-to-make-network-connected

Graph Theory

0743-network-delay-time
0787-cheapest-flights-within-k-stops
0947-most-stones-removed-with-same-row-or-column
1319-number-of-operations-to-make-network-connected
1976-number-of-ways-to-arrive-at-destination

Heap (Priority Queue)

0743-network-delay-time
0778-swim-in-rising-water
0787-cheapest-flights-within-k-stops

Shortest Path

0743-network-delay-time
0787-cheapest-flights-within-k-stops
1976-number-of-ways-to-arrive-at-destination

Topological Sort

1976-number-of-ways-to-arrive-at-destination

Array

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0778-swim-in-rising-water

Binary Search

0222-count-complete-tree-nodes
0778-swim-in-rising-water

Union-Find

0778-swim-in-rising-water
0947-most-stones-removed-with-same-row-or-column
1319-number-of-operations-to-make-network-connected

Matrix

0778-swim-in-rising-water

Hash Table

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0947-most-stones-removed-with-same-row-or-column

Database

0175-combine-two-tables

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Tree

0094-binary-tree-inorder-traversal
0102-binary-tree-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
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0543-diameter-of-binary-tree
0958-check-completeness-of-a-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0102-binary-tree-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
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0543-diameter-of-binary-tree
0958-check-completeness-of-a-binary-tree

Bit Manipulation

0222-count-complete-tree-nodes

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal