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

LeetCode Topics

Array

0051-n-queens
0137-single-number-ii
0167-two-sum-ii-input-array-is-sorted
0228-summary-ranges
0376-wiggle-subsequence
0414-third-maximum-number
0561-array-partition
0779-max-chunks-to-make-sorted-ii
0821-bricks-falling-when-hit
0833-bus-routes
0879-maximize-distance-to-closest-person
1111-minimum-score-triangulation-of-polygon
1310-watering-plants
1324-where-will-the-ball-fall
1396-count-servers-that-communicate
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1582-design-browser-history
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1679-shortest-subarray-to-be-removed-to-make-array-sorted
1705-maximum-number-of-eaten-apples
1848-sum-of-unique-elements
1849-maximum-absolute-sum-of-any-subarray
2119-minimum-number-of-operations-to-make-array-continuous
2193-count-fertile-pyramids-in-a-land
2465-shifting-letters-ii
2480-find-subarrays-with-equal-sum
2846-robot-collisions
2854-decremental-string-concatenation
3225-length-of-longest-subarray-with-at-most-k-frequency
3241-divide-array-into-arrays-with-max-difference
3525-maximum-energy-boost-from-two-drinks

String

0127-word-ladder
0168-excel-sheet-column-title
0211-design-add-and-search-words-data-structure
0657-robot-return-to-origin
0857-positions-of-large-groups
1250-longest-common-subsequence
1351-replace-the-substring-for-balanced-string
1430-find-the-k-beauty-of-a-number
1454-remove-palindromic-subsequences
1460-number-of-substrings-containing-all-three-characters
1532-reformat-the-string
1632-number-of-good-ways-to-split-a-string
1915-check-if-one-string-swap-can-make-strings-equal
2002-maximum-product-of-the-length-of-two-palindromic-subsequences
2032-largest-odd-number-in-string
2226-rings-and-rods
2465-shifting-letters-ii
2854-decremental-string-concatenation

Prefix Sum

2465-shifting-letters-ii

Depth-First Search

0111-minimum-depth-of-binary-tree
0211-design-add-and-search-words-data-structure
0513-find-bottom-left-tree-value
1396-count-servers-that-communicate
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected
1493-frog-position-after-t-seconds
1554-minimum-time-to-collect-all-apples-in-a-tree
2793-count-the-number-of-complete-components

Breadth-First Search

0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree
0127-word-ladder
0513-find-bottom-left-tree-value
0833-bus-routes
1396-count-servers-that-communicate
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected
1493-frog-position-after-t-seconds
1554-minimum-time-to-collect-all-apples-in-a-tree
2793-count-the-number-of-complete-components

Union Find

0821-bricks-falling-when-hit
1396-count-servers-that-communicate
1442-number-of-operations-to-make-network-connected
2793-count-the-number-of-complete-components

Graph

1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected
1493-frog-position-after-t-seconds
2678-design-graph-with-shortest-path-calculator
2793-count-the-number-of-complete-components

Dynamic Programming

0376-wiggle-subsequence
1111-minimum-score-triangulation-of-polygon
1250-longest-common-subsequence
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1632-number-of-good-ways-to-split-a-string
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1849-maximum-absolute-sum-of-any-subarray
2002-maximum-product-of-the-length-of-two-palindromic-subsequences
2193-count-fertile-pyramids-in-a-land
2854-decremental-string-concatenation
3525-maximum-energy-boost-from-two-drinks

Greedy

0376-wiggle-subsequence
0561-array-partition
0779-max-chunks-to-make-sorted-ii
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1705-maximum-number-of-eaten-apples
2032-largest-odd-number-in-string
3241-divide-array-into-arrays-with-max-difference

Simulation

0657-robot-return-to-origin
1310-watering-plants
1324-where-will-the-ball-fall
2846-robot-collisions

Hash Table

0127-word-ladder
0833-bus-routes
1064-smallest-integer-divisible-by-k
1460-number-of-substrings-containing-all-three-characters
1554-minimum-time-to-collect-all-apples-in-a-tree
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1632-number-of-good-ways-to-split-a-string
1848-sum-of-unique-elements
1915-check-if-one-string-swap-can-make-strings-equal
2119-minimum-number-of-operations-to-make-array-continuous
2226-rings-and-rods
2480-find-subarrays-with-equal-sum
3225-length-of-longest-subarray-with-at-most-k-frequency

Binary Search

0167-two-sum-ii-input-array-is-sorted
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1679-shortest-subarray-to-be-removed-to-make-array-sorted
2119-minimum-number-of-operations-to-make-array-continuous

Sliding Window

1351-replace-the-substring-for-balanced-string
1430-find-the-k-beauty-of-a-number
1460-number-of-substrings-containing-all-three-characters
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
2119-minimum-number-of-operations-to-make-array-continuous
3225-length-of-longest-subarray-with-at-most-k-frequency

Tree

0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree
0450-delete-node-in-a-bst
0513-find-bottom-left-tree-value
1493-frog-position-after-t-seconds
1554-minimum-time-to-collect-all-apples-in-a-tree

Binary Tree

0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree
0450-delete-node-in-a-bst
0513-find-bottom-left-tree-value

Sorting

0414-third-maximum-number
0561-array-partition
0779-max-chunks-to-make-sorted-ii
2846-robot-collisions
3241-divide-array-into-arrays-with-max-difference

Counting Sort

0561-array-partition
1396-count-servers-that-communicate
1848-sum-of-unique-elements
1915-check-if-one-string-swap-can-make-strings-equal

Binary Search Tree

0450-delete-node-in-a-bst

Math

0168-excel-sheet-column-title
0319-bulb-switcher
1064-smallest-integer-divisible-by-k
1430-find-the-k-beauty-of-a-number
2032-largest-odd-number-in-string

Topological Sort

1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph

Stack

0779-max-chunks-to-make-sorted-ii
1582-design-browser-history
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1679-shortest-subarray-to-be-removed-to-make-array-sorted
2846-robot-collisions

Two Pointers

0167-two-sum-ii-input-array-is-sorted
1454-remove-palindromic-subsequences
1679-shortest-subarray-to-be-removed-to-make-array-sorted

Monotonic Stack

0779-max-chunks-to-make-sorted-ii
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1679-shortest-subarray-to-be-removed-to-make-array-sorted

Linked List

1582-design-browser-history
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points

Design

0211-design-add-and-search-words-data-structure
1582-design-browser-history
2678-design-graph-with-shortest-path-calculator

Doubly-Linked List

1582-design-browser-history

Data Stream

1582-design-browser-history

Matrix

0821-bricks-falling-when-hit
1324-where-will-the-ball-fall
1396-count-servers-that-communicate
2193-count-fertile-pyramids-in-a-land

Bit Manipulation

0137-single-number-ii
1632-number-of-good-ways-to-split-a-string
2002-maximum-product-of-the-length-of-two-palindromic-subsequences

Heap (Priority Queue)

1705-maximum-number-of-eaten-apples
2678-design-graph-with-shortest-path-calculator

Shortest Path

2678-design-graph-with-shortest-path-calculator

Backtracking

0051-n-queens
2002-maximum-product-of-the-length-of-two-palindromic-subsequences

Brainteaser

0319-bulb-switcher

Trie

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

Bitmask

2002-maximum-product-of-the-length-of-two-palindromic-subsequences