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

LeetCode Topics

Bit Manipulation

Problem Name	Difficulty
0338-counting-bits
0868-binary-gap
1009-complement-of-base-10-integer	Easy

Dynamic Programming

Problem Name	Difficulty
0010-regular-expression-matching	Hard
0338-counting-bits
0894-all-possible-full-binary-trees	Medium
1320-minimum-distance-to-type-a-word-using-two-fingers	Hard
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
2463-minimum-total-distance-traveled	Hard
3129-find-all-possible-stable-binary-arrays-i	Medium
3225-maximum-score-from-grid-operations	Hard
3418-maximum-amount-of-money-robot-can-earn	Medium
3661-maximum-walls-destroyed-by-robots	Hard
3857-minimum-cost-to-split-into-ones	Medium

String

Problem Name	Difficulty
0010-regular-expression-matching	Hard
0030-substring-with-concatenation-of-all-words	Hard
0043-multiply-strings	Medium
0049-group-anagrams	Medium
0065-valid-number	Hard
0071-simplify-path	Medium
0657-robot-return-to-origin	Easy
0763-partition-labels	Medium
0833-find-and-replace-in-string	Medium
1221-split-a-string-in-balanced-strings	Easy
1320-minimum-distance-to-type-a-word-using-two-fingers	Hard
1545-find-kth-bit-in-nth-binary-string	Medium
1758-minimum-changes-to-make-alternating-binary-string	Easy
1769-minimum-number-of-operations-to-move-all-balls-to-each-box	Medium
1784-check-if-binary-string-has-at-most-one-segment-of-ones	Easy
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
1980-find-unique-binary-string	Medium
2000-reverse-prefix-of-word	Easy
2075-decode-the-slanted-ciphertext	Medium
2452-words-within-two-edits-of-dictionary	Medium
2515-shortest-distance-to-target-string-in-a-circular-array	Easy
2833-furthest-point-from-origin	Easy
2840-check-if-strings-can-be-made-equal-with-operations-ii	Medium
3474-lexicographically-smallest-generated-string	Hard

Recursion

Problem Name	Difficulty
0010-regular-expression-matching	Hard
0894-all-possible-full-binary-trees	Medium
1545-find-kth-bit-in-nth-binary-string	Medium

Simulation

Problem Name	Difficulty
0043-multiply-strings	Medium
0657-robot-return-to-origin	Easy
0874-walking-robot-simulation	Medium
1545-find-kth-bit-in-nth-binary-string	Medium
1920-build-array-from-permutation	Easy
2069-walking-robot-simulation-ii	Medium
2075-decode-the-slanted-ciphertext	Medium
2161-partition-array-according-to-given-pivot	Medium
2751-robot-collisions	Hard
3701-compute-alternating-sum	Easy

Array

Problem Name	Difficulty
0041-first-missing-positive	Hard
0046-permutations	Medium
0049-group-anagrams	Medium
0088-merge-sorted-array	Easy
0380-insert-delete-getrandom-o1	Medium
0833-find-and-replace-in-string	Medium
0874-walking-robot-simulation	Medium
1282-group-the-people-given-the-group-size-they-belong-to	Medium
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid	Hard
1391-check-if-there-is-a-valid-path-in-a-grid	Medium
1512-number-of-good-pairs	Easy
1559-detect-cycles-in-2d-grid	Medium
1582-special-positions-in-a-binary-matrix	Easy
1685-sum-of-absolute-differences-in-a-sorted-array	Medium
1722-minimize-hamming-distance-after-swap-operations	Medium
1727-largest-submatrix-with-rearrangements	Medium
1769-minimum-number-of-operations-to-move-all-balls-to-each-box	Medium
1848-minimum-distance-to-the-target-element	Easy
1855-maximum-distance-between-a-pair-of-values	Medium
1861-rotating-the-box	Medium
1886-determine-whether-matrix-can-be-obtained-by-rotation	Easy
1893-check-if-all-the-integers-in-a-range-are-covered	Easy
1920-build-array-from-permutation	Easy
1980-find-unique-binary-string	Medium
2033-minimum-operations-to-make-a-uni-value-grid	Medium
2078-two-furthest-houses-with-different-colors	Easy
2134-minimum-swaps-to-group-all-1s-together-ii	Medium
2161-partition-array-according-to-given-pivot	Medium
2333-minimum-sum-of-squared-difference	Medium
2452-words-within-two-edits-of-dictionary	Medium
2463-minimum-total-distance-traveled	Hard
2515-shortest-distance-to-target-string-in-a-circular-array	Easy
2615-sum-of-distances	Medium
2751-robot-collisions	Hard
2824-count-pairs-whose-sum-is-less-than-target	Easy
3070-count-submatrices-with-top-left-element-and-sum-less-than-k	Medium
3071-minimum-operations-to-write-the-letter-y-on-a-grid	Medium
3212-count-submatrices-with-equal-frequency-of-x-and-y	Medium
3225-maximum-score-from-grid-operations	Hard
3418-maximum-amount-of-money-robot-can-earn	Medium
3464-maximize-the-distance-between-points-on-a-square	Hard
3488-closest-equal-element-queries	Medium
3567-minimum-absolute-difference-in-sliding-submatrix	Medium
3643-flip-square-submatrix-vertically	Easy
3655-xor-after-range-multiplication-queries-ii	Hard
3661-maximum-walls-destroyed-by-robots	Hard
3668-restore-finishing-order	Easy
3701-compute-alternating-sum	Easy
3740-minimum-distance-between-three-equal-elements-i	Easy
3741-minimum-distance-between-three-equal-elements-ii	Medium
3761-minimum-absolute-distance-between-mirror-pairs	Medium

Matrix

Problem Name	Difficulty
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid	Hard
1391-check-if-there-is-a-valid-path-in-a-grid	Medium
1559-detect-cycles-in-2d-grid	Medium
1582-special-positions-in-a-binary-matrix	Easy
1727-largest-submatrix-with-rearrangements	Medium
1861-rotating-the-box	Medium
1886-determine-whether-matrix-can-be-obtained-by-rotation	Easy
2033-minimum-operations-to-make-a-uni-value-grid	Medium
3070-count-submatrices-with-top-left-element-and-sum-less-than-k	Medium
3071-minimum-operations-to-write-the-letter-y-on-a-grid	Medium
3212-count-submatrices-with-equal-frequency-of-x-and-y	Medium
3225-maximum-score-from-grid-operations	Hard
3418-maximum-amount-of-money-robot-can-earn	Medium
3567-minimum-absolute-difference-in-sliding-submatrix	Medium
3643-flip-square-submatrix-vertically	Easy

Sliding Window

Problem Name	Difficulty
0030-substring-with-concatenation-of-all-words	Hard
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
2134-minimum-swaps-to-group-all-1s-together-ii	Medium

Hash Table

Problem Name	Difficulty
0030-substring-with-concatenation-of-all-words	Hard
0041-first-missing-positive	Hard
0049-group-anagrams	Medium
0380-insert-delete-getrandom-o1	Medium
0763-partition-labels	Medium
0833-find-and-replace-in-string	Medium
0874-walking-robot-simulation	Medium
1282-group-the-people-given-the-group-size-they-belong-to	Medium
1512-number-of-good-pairs	Easy
1893-check-if-all-the-integers-in-a-range-are-covered	Easy
1980-find-unique-binary-string	Medium
2615-sum-of-distances	Medium
2840-check-if-strings-can-be-made-equal-with-operations-ii	Medium
3071-minimum-operations-to-write-the-letter-y-on-a-grid	Medium
3488-closest-equal-element-queries	Medium
3668-restore-finishing-order	Easy
3740-minimum-distance-between-three-equal-elements-i	Easy
3741-minimum-distance-between-three-equal-elements-ii	Medium
3761-minimum-absolute-distance-between-mirror-pairs	Medium

Backtracking

Problem Name	Difficulty
0046-permutations	Medium
1980-find-unique-binary-string	Medium

Prefix Sum

Problem Name	Difficulty
1685-sum-of-absolute-differences-in-a-sorted-array	Medium
1769-minimum-number-of-operations-to-move-all-balls-to-each-box	Medium
1893-check-if-all-the-integers-in-a-range-are-covered	Easy
2615-sum-of-distances	Medium
3070-count-submatrices-with-top-left-element-and-sum-less-than-k	Medium
3129-find-all-possible-stable-binary-arrays-i	Medium
3212-count-submatrices-with-equal-frequency-of-x-and-y	Medium
3225-maximum-score-from-grid-operations	Hard

Sorting

Problem Name	Difficulty
0049-group-anagrams	Medium
0088-merge-sorted-array	Easy
0833-find-and-replace-in-string	Medium
1727-largest-submatrix-with-rearrangements	Medium
2033-minimum-operations-to-make-a-uni-value-grid	Medium
2333-minimum-sum-of-squared-difference	Medium
2463-minimum-total-distance-traveled	Hard
2751-robot-collisions	Hard
2824-count-pairs-whose-sum-is-less-than-target	Easy
2840-check-if-strings-can-be-made-equal-with-operations-ii	Medium
3464-maximize-the-distance-between-points-on-a-square	Hard
3567-minimum-absolute-difference-in-sliding-submatrix	Medium
3661-maximum-walls-destroyed-by-robots	Hard

Two Pointers

Problem Name	Difficulty
0088-merge-sorted-array	Easy
0763-partition-labels	Medium
1855-maximum-distance-between-a-pair-of-values	Medium
1861-rotating-the-box	Medium
2000-reverse-prefix-of-word	Easy
2161-partition-array-according-to-given-pivot	Medium
2396-strictly-palindromic-number	Medium
2824-count-pairs-whose-sum-is-less-than-target	Easy
3643-flip-square-submatrix-vertically	Easy

Math

Problem Name	Difficulty
0043-multiply-strings	Medium
0380-insert-delete-getrandom-o1	Medium
0478-generate-random-point-in-a-circle	Medium
1512-number-of-good-pairs	Easy
1685-sum-of-absolute-differences-in-a-sorted-array	Medium
2033-minimum-operations-to-make-a-uni-value-grid	Medium
2396-strictly-palindromic-number	Medium
2769-find-the-maximum-achievable-number	Easy
3464-maximize-the-distance-between-points-on-a-square	Hard
3761-minimum-absolute-distance-between-mirror-pairs	Medium
3783-mirror-distance-of-an-integer	Easy
3857-minimum-cost-to-split-into-ones	Medium

Tree

Problem Name	Difficulty
0894-all-possible-full-binary-trees	Medium

Memoization

Problem Name	Difficulty
0894-all-possible-full-binary-trees	Medium

Binary Tree

Problem Name	Difficulty
0894-all-possible-full-binary-trees	Medium

Binary Search

Problem Name	Difficulty
1855-maximum-distance-between-a-pair-of-values	Medium
2333-minimum-sum-of-squared-difference	Medium
2824-count-pairs-whose-sum-is-less-than-target	Easy
3464-maximize-the-distance-between-points-on-a-square	Hard
3488-closest-equal-element-queries	Medium
3661-maximum-walls-destroyed-by-robots	Hard

Greedy

Problem Name	Difficulty
0763-partition-labels	Medium
1221-split-a-string-in-balanced-strings	Easy
1282-group-the-people-given-the-group-size-they-belong-to	Medium
1727-largest-submatrix-with-rearrangements	Medium
2078-two-furthest-houses-with-different-colors	Easy
2333-minimum-sum-of-squared-difference	Medium
3474-lexicographically-smallest-generated-string	Hard

Counting

Problem Name	Difficulty
1221-split-a-string-in-balanced-strings	Easy
1512-number-of-good-pairs	Easy
2833-furthest-point-from-origin	Easy
3071-minimum-operations-to-write-the-letter-y-on-a-grid	Medium

String Matching

Problem Name	Difficulty
3474-lexicographically-smallest-generated-string	Hard

Stack

Problem Name	Difficulty
0071-simplify-path	Medium
0155-min-stack	Medium
2000-reverse-prefix-of-word	Easy
2751-robot-collisions	Hard

Brainteaser

Problem Name	Difficulty
2396-strictly-palindromic-number	Medium

Design

Problem Name	Difficulty
0155-min-stack	Medium
0380-insert-delete-getrandom-o1	Medium
2069-walking-robot-simulation-ii	Medium

Randomized

Problem Name	Difficulty
0380-insert-delete-getrandom-o1	Medium
0478-generate-random-point-in-a-circle	Medium

Divide and Conquer

Problem Name	Difficulty
3655-xor-after-range-multiplication-queries-ii	Hard

Geometry

Problem Name	Difficulty
0478-generate-random-point-in-a-circle	Medium
3464-maximize-the-distance-between-points-on-a-square	Hard

Rejection Sampling

Problem Name	Difficulty
0478-generate-random-point-in-a-circle	Medium

Breadth-First Search

Problem Name	Difficulty
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid	Hard
1391-check-if-there-is-a-valid-path-in-a-grid	Medium
1559-detect-cycles-in-2d-grid	Medium

Graph Theory

Problem Name	Difficulty
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid	Hard

Heap (Priority Queue)

Problem Name	Difficulty
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid	Hard
2333-minimum-sum-of-squared-difference	Medium

Shortest Path

Problem Name	Difficulty
1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid	Hard

Depth-First Search

Problem Name	Difficulty
1391-check-if-there-is-a-valid-path-in-a-grid	Medium
1559-detect-cycles-in-2d-grid	Medium
1722-minimize-hamming-distance-after-swap-operations	Medium

Union-Find

Problem Name	Difficulty
1391-check-if-there-is-a-valid-path-in-a-grid	Medium
1559-detect-cycles-in-2d-grid	Medium
1722-minimize-hamming-distance-after-swap-operations	Medium

Trie

Problem Name	Difficulty
2452-words-within-two-edits-of-dictionary	Medium