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

LeetCode Topics

Array

0016-3sum-closest
0018-4sum
0079-word-search
0130-surrounded-regions
0200-number-of-islands
0283-move-zeroes
0399-evaluate-division
0905-sort-array-by-parity
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1514-path-with-maximum-probability
2662-minimum-cost-of-a-path-with-special-roads
2976-minimum-cost-to-convert-string-i
3112-minimum-time-to-visit-disappearing-nodes
3286-find-a-safe-walk-through-a-grid
3341-find-minimum-time-to-reach-last-room-i
3342-find-minimum-time-to-reach-last-room-ii

String

0079-word-search
0168-excel-sheet-column-title
0171-excel-sheet-column-number
0205-isomorphic-strings
0211-design-add-and-search-words-data-structure
0257-binary-tree-paths
0290-word-pattern
0344-reverse-string
0345-reverse-vowels-of-a-string
0383-ransom-note
0387-first-unique-character-in-a-string
0399-evaluate-division
0405-convert-a-number-to-hexadecimal
0412-fizz-buzz
0415-add-strings
0434-number-of-segments-in-a-string
0482-license-key-formatting
0709-to-lower-case
2976-minimum-cost-to-convert-string-i

Depth-First Search

0079-word-search
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0211-design-add-and-search-words-data-structure
0226-invert-binary-tree
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
0310-minimum-height-trees
0337-house-robber-iii
0399-evaluate-division
0404-sum-of-left-leaves
0559-maximum-depth-of-n-ary-tree
0671-second-minimum-node-in-a-binary-tree
0743-network-delay-time
0787-cheapest-flights-within-k-stops
0965-univalued-binary-tree
0993-cousins-in-binary-tree
1022-sum-of-root-to-leaf-binary-numbers
3419-minimize-the-maximum-edge-weight-of-graph

Breadth-First Search

0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0310-minimum-height-trees
0399-evaluate-division
0404-sum-of-left-leaves
0559-maximum-depth-of-n-ary-tree
0743-network-delay-time
0787-cheapest-flights-within-k-stops
0965-univalued-binary-tree
0993-cousins-in-binary-tree
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3419-minimize-the-maximum-edge-weight-of-graph

Union-Find

0130-surrounded-regions
0200-number-of-islands
0399-evaluate-division

Graph Theory

0207-course-schedule
0210-course-schedule-ii
0310-minimum-height-trees
0399-evaluate-division
0743-network-delay-time
0787-cheapest-flights-within-k-stops
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1514-path-with-maximum-probability
1786-number-of-restricted-paths-from-first-to-last-node
1976-number-of-ways-to-arrive-at-destination
2662-minimum-cost-of-a-path-with-special-roads
2976-minimum-cost-to-convert-string-i
3112-minimum-time-to-visit-disappearing-nodes
3286-find-a-safe-walk-through-a-grid
3341-find-minimum-time-to-reach-last-room-i
3342-find-minimum-time-to-reach-last-room-ii
3377-digit-operations-to-make-two-integers-equal
3419-minimize-the-maximum-edge-weight-of-graph
3604-minimum-time-to-reach-destination-in-directed-graph
3650-minimum-cost-path-with-edge-reversals

Shortest Path

0399-evaluate-division
0743-network-delay-time
0787-cheapest-flights-within-k-stops
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1514-path-with-maximum-probability
1786-number-of-restricted-paths-from-first-to-last-node
1976-number-of-ways-to-arrive-at-destination
2662-minimum-cost-of-a-path-with-special-roads
2976-minimum-cost-to-convert-string-i
3112-minimum-time-to-visit-disappearing-nodes
3286-find-a-safe-walk-through-a-grid
3341-find-minimum-time-to-reach-last-room-i
3342-find-minimum-time-to-reach-last-room-ii
3377-digit-operations-to-make-two-integers-equal
3419-minimize-the-maximum-edge-weight-of-graph
3604-minimum-time-to-reach-destination-in-directed-graph
3650-minimum-cost-path-with-edge-reversals

Heap (Priority Queue)

0743-network-delay-time
0787-cheapest-flights-within-k-stops
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1514-path-with-maximum-probability
1786-number-of-restricted-paths-from-first-to-last-node
2662-minimum-cost-of-a-path-with-special-roads
3112-minimum-time-to-visit-disappearing-nodes
3286-find-a-safe-walk-through-a-grid
3341-find-minimum-time-to-reach-last-room-i
3342-find-minimum-time-to-reach-last-room-ii
3377-digit-operations-to-make-two-integers-equal
3604-minimum-time-to-reach-destination-in-directed-graph
3650-minimum-cost-path-with-edge-reversals

Dynamic Programming

0337-house-robber-iii
0787-cheapest-flights-within-k-stops
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1786-number-of-restricted-paths-from-first-to-last-node
1976-number-of-ways-to-arrive-at-destination

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0310-minimum-height-trees
1786-number-of-restricted-paths-from-first-to-last-node
1976-number-of-ways-to-arrive-at-destination

Matrix

0079-word-search
0130-surrounded-regions
0200-number-of-islands
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3341-find-minimum-time-to-reach-last-room-i
3342-find-minimum-time-to-reach-last-room-ii

Math

0168-excel-sheet-column-title
0171-excel-sheet-column-number
0202-happy-number
0405-convert-a-number-to-hexadecimal
0412-fizz-buzz
0415-add-strings
3377-digit-operations-to-make-two-integers-equal

Number Theory

3377-digit-operations-to-make-two-integers-equal

Binary Search

3419-minimize-the-maximum-edge-weight-of-graph

Backtracking

0079-word-search
0113-path-sum-ii
0257-binary-tree-paths

Hash Table

0202-happy-number
0205-isomorphic-strings
0290-word-pattern
0383-ransom-note
0387-first-unique-character-in-a-string

Two Pointers

0016-3sum-closest
0018-4sum
0019-remove-nth-node-from-end-of-list
0202-happy-number
0283-move-zeroes
0344-reverse-string
0345-reverse-vowels-of-a-string
0905-sort-array-by-parity

Counting

0383-ransom-note
0387-first-unique-character-in-a-string

Queue

0387-first-unique-character-in-a-string

Bit Manipulation

0405-convert-a-number-to-hexadecimal

Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
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
0337-house-robber-iii
0404-sum-of-left-leaves
0559-maximum-depth-of-n-ary-tree
0671-second-minimum-node-in-a-binary-tree
0965-univalued-binary-tree
0993-cousins-in-binary-tree
1022-sum-of-root-to-leaf-binary-numbers

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree

Binary Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
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
0337-house-robber-iii
0404-sum-of-left-leaves
0671-second-minimum-node-in-a-binary-tree
0965-univalued-binary-tree
0993-cousins-in-binary-tree
1022-sum-of-root-to-leaf-binary-numbers

Linked List

0019-remove-nth-node-from-end-of-list
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii

Stack

0114-flatten-binary-tree-to-linked-list

Simulation

0412-fizz-buzz
0415-add-strings

Design

0211-design-add-and-search-words-data-structure

Trie

0211-design-add-and-search-words-data-structure

Sorting

0016-3sum-closest
0018-4sum
0905-sort-array-by-parity