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

LeetCode Topics

Divide and Conquer

0169-majority-element
0215-kth-largest-element-in-an-array
1285-balance-a-binary-search-tree

Greedy

1285-balance-a-binary-search-tree

Tree

1285-balance-a-binary-search-tree
2306-create-binary-tree-from-descriptions

Depth-First Search

0547-number-of-provinces
1285-balance-a-binary-search-tree

Binary Search Tree

0268-missing-number
0792-binary-search
1285-balance-a-binary-search-tree

Binary Tree

1285-balance-a-binary-search-tree
2306-create-binary-tree-from-descriptions

Breadth-First Search

0547-number-of-provinces
1036-rotting-oranges

Union Find

0128-longest-consecutive-sequence
0547-number-of-provinces

Graph

0547-number-of-provinces

Array

0001-two-sum
0026-remove-duplicates-from-sorted-array
0027-remove-element
0031-next-permutation
0054-spiral-matrix
0075-sort-colors
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0136-single-number
0169-majority-element
0189-rotate-array
0198-house-robber
0215-kth-largest-element-in-an-array
0268-missing-number
0283-move-zeroes
0485-max-consecutive-ones
0792-binary-search
1036-rotting-oranges
1720-crawler-log-folder
1803-average-waiting-time
1878-check-if-array-is-sorted-and-rotated
1951-find-the-winner-of-the-circular-game
2306-create-binary-tree-from-descriptions
3418-count-pairs-that-form-a-complete-day-ii
3421-count-pairs-that-form-a-complete-day-i
3469-maximum-height-of-a-triangle
3471-minimum-average-of-smallest-and-largest-elements
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
3476-find-minimum-operations-to-make-all-elements-divisible-by-three

Matrix

0054-spiral-matrix
1036-rotting-oranges

Math

0002-add-two-numbers
0013-roman-to-integer
0070-climbing-stairs
0189-rotate-array
0268-missing-number
1642-water-bottles
1951-find-the-winner-of-the-circular-game
3476-find-minimum-operations-to-make-all-elements-divisible-by-three

Dynamic Programming

0070-climbing-stairs
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0198-house-robber

Memoization

0070-climbing-stairs

Two Pointers

0026-remove-duplicates-from-sorted-array
0027-remove-element
0031-next-permutation
0075-sort-colors
0189-rotate-array
0283-move-zeroes
3471-minimum-average-of-smallest-and-largest-elements

Hash Table

0001-two-sum
0013-roman-to-integer
0128-longest-consecutive-sequence
0169-majority-element
0268-missing-number
1619-path-crossing
2306-create-binary-tree-from-descriptions
3412-permutation-difference-between-two-strings
3418-count-pairs-that-form-a-complete-day-ii
3421-count-pairs-that-form-a-complete-day-i
3447-clear-digits

Sorting

0075-sort-colors
0169-majority-element
0215-kth-largest-element-in-an-array
0268-missing-number
3471-minimum-average-of-smallest-and-largest-elements

Counting

0169-majority-element
3418-count-pairs-that-form-a-complete-day-ii
3421-count-pairs-that-form-a-complete-day-i

Linked List

0002-add-two-numbers
2299-merge-nodes-in-between-zeros

Simulation

0054-spiral-matrix
1642-water-bottles
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2299-merge-nodes-in-between-zeros
3447-clear-digits

Enumeration

3469-maximum-height-of-a-triangle

String

0006-zigzag-conversion
0013-roman-to-integer
1619-path-crossing
1720-crawler-log-folder
3412-permutation-difference-between-two-strings
3447-clear-digits

Database

0197-rising-temperature
0570-managers-with-at-least-5-direct-reports
0577-employee-bonus
0584-find-customer-referee
0595-big-countries
0620-not-boring-movies
1153-product-sales-analysis-i
1161-project-employees-i
1258-article-views-i
1390-average-selling-price
1509-replace-employee-id-with-the-unique-identifier
1724-customer-who-visited-but-did-not-make-any-transactions
1801-average-time-of-process-per-machine
1827-invalid-tweets
1892-find-total-time-spent-by-each-employee
1908-recyclable-and-low-fat-products
2495-number-of-unique-subjects-taught-by-each-teacher

Bit Manipulation

0136-single-number
0268-missing-number
2323-minimum-bit-flips-to-convert-number
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Queue

1951-find-the-winner-of-the-circular-game
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Sliding Window

3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Prefix Sum

3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Recursion

0002-add-two-numbers
1951-find-the-winner-of-the-circular-game

Stack

1720-crawler-log-folder

Heap (Priority Queue)

0215-kth-largest-element-in-an-array

Quickselect

0215-kth-largest-element-in-an-array