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

LeetCode Topics

Array

0014-longest-common-prefix
0027-remove-element
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0066-plus-one
0081-search-in-rotated-sorted-array-ii
0088-merge-sorted-array
0118-pascals-triangle
0119-pascals-triangle-ii
0136-single-number
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0189-rotate-array
0209-minimum-size-subarray-sum
0217-contains-duplicate
0219-contains-duplicate-ii
0268-missing-number
0283-move-zeroes
0643-maximum-average-subarray-i
0704-binary-search
0744-find-smallest-letter-greater-than-target
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
0977-squares-of-a-sorted-array
1004-max-consecutive-ones-iii
1295-find-numbers-with-even-number-of-digits
1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
1365-how-many-numbers-are-smaller-than-the-current-number
1431-kids-with-the-greatest-number-of-candies
1470-shuffle-the-array
1480-running-sum-of-1d-array
1672-richest-customer-wealth
1752-check-if-array-is-sorted-and-rotated
1920-build-array-from-permutation
1929-concatenation-of-array
2073-time-needed-to-buy-tickets
2460-apply-operations-to-an-array
3550-smallest-index-with-digit-sum-equal-to-index
3875-construct-uniform-parity-array-i
3876-construct-uniform-parity-array-ii

String

0003-longest-substring-without-repeating-characters
0013-roman-to-integer
0014-longest-common-prefix
0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0344-reverse-string
0387-first-unique-character-in-a-string
0412-fizz-buzz
0424-longest-repeating-character-replacement
0438-find-all-anagrams-in-a-string
0504-base-7
0567-permutation-in-string
1208-get-equal-substrings-within-budget
1456-maximum-number-of-vowels-in-a-substring-of-given-length
2379-minimum-recolors-to-get-k-consecutive-black-blocks

Trie

0014-longest-common-prefix

Two Pointers

0019-remove-nth-node-from-end-of-list
0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string
0061-rotate-list
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0160-intersection-of-two-linked-lists
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0234-palindrome-linked-list
0283-move-zeroes
0344-reverse-string
0567-permutation-in-string
0876-middle-of-the-linked-list
0977-squares-of-a-sorted-array
2460-apply-operations-to-an-array

Sorting

0088-merge-sorted-array
0148-sort-list
0169-majority-element
0217-contains-duplicate
0268-missing-number
0977-squares-of-a-sorted-array
1365-how-many-numbers-are-smaller-than-the-current-number

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0081-search-in-rotated-sorted-array-ii
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0209-minimum-size-subarray-sum
0268-missing-number
0374-guess-number-higher-or-lower
0704-binary-search
0744-find-smallest-letter-greater-than-target
1004-max-consecutive-ones-iii
1208-get-equal-substrings-within-budget

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0013-roman-to-integer
0066-plus-one
0189-rotate-array
0268-missing-number
0412-fizz-buzz
0504-base-7
1290-convert-binary-number-in-a-linked-list-to-integer
1295-find-numbers-with-even-number-of-digits
3550-smallest-index-with-digit-sum-equal-to-index
3875-construct-uniform-parity-array-i
3876-construct-uniform-parity-array-ii

Dynamic Programming

0118-pascals-triangle
0119-pascals-triangle-ii

Bit Manipulation

0136-single-number
0268-missing-number

Hash Table

0003-longest-substring-without-repeating-characters
0013-roman-to-integer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0217-contains-duplicate
0219-contains-duplicate-ii
0268-missing-number
0387-first-unique-character-in-a-string
0424-longest-repeating-character-replacement
0438-find-all-anagrams-in-a-string
0567-permutation-in-string
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
1365-how-many-numbers-are-smaller-than-the-current-number

Stack

0020-valid-parentheses
0143-reorder-list
0144-binary-tree-preorder-traversal
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list

Bracket Sequences

0020-valid-parentheses

Simulation

0412-fizz-buzz
1920-build-array-from-permutation
1929-concatenation-of-array
2073-time-needed-to-buy-tickets
2460-apply-operations-to-an-array

Prefix Sum

0209-minimum-size-subarray-sum
0930-binary-subarrays-with-sum
1004-max-consecutive-ones-iii
1208-get-equal-substrings-within-budget
1480-running-sum-of-1d-array

Counting Sort

0169-majority-element
0387-first-unique-character-in-a-string
1365-how-many-numbers-are-smaller-than-the-current-number

Matrix

1672-richest-customer-wealth

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string

Z Algorithm

0028-find-the-index-of-the-first-occurrence-in-a-string

Knuth–Morris–Pratt Algorithm

0028-find-the-index-of-the-first-occurrence-in-a-string

Boyer–Moore String-Search Algorithm

0028-find-the-index-of-the-first-occurrence-in-a-string

Divide and Conquer

0148-sort-list
0169-majority-element

Boyer–Moore Majority Vote Algorithm

0169-majority-element

Sliding Window

0003-longest-substring-without-repeating-characters
0209-minimum-size-subarray-sum
0219-contains-duplicate-ii
0424-longest-repeating-character-replacement
0438-find-all-anagrams-in-a-string
0567-permutation-in-string
0643-maximum-average-subarray-i
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
1004-max-consecutive-ones-iii
1208-get-equal-substrings-within-budget
1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
1456-maximum-number-of-vowels-in-a-substring-of-given-length
2379-minimum-recolors-to-get-k-consecutive-black-blocks

Design

0225-implement-stack-using-queues
0232-implement-queue-using-stacks

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0387-first-unique-character-in-a-string
2073-time-needed-to-buy-tickets

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0061-rotate-list
0083-remove-duplicates-from-sorted-list
0092-reverse-linked-list-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0160-intersection-of-two-linked-lists
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0876-middle-of-the-linked-list
1290-convert-binary-number-in-a-linked-list-to-integer

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0143-reorder-list
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list

Floyd's Cycle Finding Algorithm

0141-linked-list-cycle
0142-linked-list-cycle-ii

Merge Sort

0148-sort-list

Interactive

0374-guess-number-higher-or-lower

Tree

0102-binary-tree-level-order-traversal
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0144-binary-tree-preorder-traversal
0669-trim-a-binary-search-tree

Depth-First Search

0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0144-binary-tree-preorder-traversal
0669-trim-a-binary-search-tree

Binary Tree

0102-binary-tree-level-order-traversal
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0144-binary-tree-preorder-traversal
0669-trim-a-binary-search-tree

Breadth-First Search

0102-binary-tree-level-order-traversal
0111-minimum-depth-of-binary-tree

Backtracking

0113-path-sum-ii

Binary Search Tree

0669-trim-a-binary-search-tree