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

LeetCode Topics

Array

0051-n-queens
1105-uncrossed-lines
1121-partition-array-for-maximum-sum
1393-maximum-value-of-k-coins-from-piles
1402-count-square-submatrices-with-all-ones
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
2364-longest-path-with-different-adjacent-characters
3264-maximum-points-after-enemy-battles
3391-maximum-difference-score-in-a-grid
3413-find-the-first-player-to-win-k-games-in-a-row
3416-sum-of-digit-differences-of-all-pairs
3420-find-occurrences-of-an-element-in-an-array
3422-find-the-n-th-value-after-k-seconds
3427-special-array-ii
3430-count-days-without-meetings
3434-find-the-number-of-distinct-colors-among-the-balls
3437-maximum-total-damage-with-spell-casting
3442-maximum-total-reward-using-operations-i
3456-find-the-maximum-length-of-a-good-subsequence-i
3461-find-the-minimum-area-to-cover-all-ones-i
3464-maximize-total-cost-of-alternating-subarrays
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii
3492-count-submatrices-with-equal-frequency-of-x-and-y
3494-minimum-cost-for-cutting-cake-i
3501-delete-nodes-from-linked-list-present-in-array

Dynamic Programming

0863-sum-of-distances-in-tree
1105-uncrossed-lines
1121-partition-array-for-maximum-sum
1393-maximum-value-of-k-coins-from-piles
1402-count-square-submatrices-with-all-ones
1437-minimum-insertion-steps-to-make-a-string-palindrome
1517-restore-the-array
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
3391-maximum-difference-score-in-a-grid
3403-minimum-substring-partition-of-equal-character-frequency
3437-maximum-total-damage-with-spell-casting
3442-maximum-total-reward-using-operations-i
3456-find-the-maximum-length-of-a-good-subsequence-i
3464-maximize-total-cost-of-alternating-subarrays
3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii
3494-minimum-cost-for-cutting-cake-i

Prefix Sum

1393-maximum-value-of-k-coins-from-piles
3422-find-the-n-th-value-after-k-seconds
3427-special-array-ii
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
3492-count-submatrices-with-equal-frequency-of-x-and-y

String

1437-minimum-insertion-steps-to-make-a-string-palindrome
1517-restore-the-array
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
2364-longest-path-with-different-adjacent-characters
3403-minimum-substring-partition-of-equal-character-frequency
3445-lexicographically-minimum-string-after-removing-stars
3453-generate-binary-strings-without-adjacent-zeros
3468-find-the-encrypted-string
3484-lexicographically-smallest-string-after-a-swap

Greedy

3264-maximum-points-after-enemy-battles
3445-lexicographically-minimum-string-after-removing-stars
3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii
3484-lexicographically-smallest-string-after-a-swap
3494-minimum-cost-for-cutting-cake-i

Sorting

3430-count-days-without-meetings
3437-maximum-total-damage-with-spell-casting
3494-minimum-cost-for-cutting-cake-i

Hash Table

1554-minimum-time-to-collect-all-apples-in-a-tree
1643-number-of-nodes-in-the-sub-tree-with-the-same-label
3403-minimum-substring-partition-of-equal-character-frequency
3416-sum-of-digit-differences-of-all-pairs
3420-find-occurrences-of-an-element-in-an-array
3434-find-the-number-of-distinct-colors-among-the-balls
3437-maximum-total-damage-with-spell-casting
3445-lexicographically-minimum-string-after-removing-stars
3456-find-the-maximum-length-of-a-good-subsequence-i
3501-delete-nodes-from-linked-list-present-in-array

Linked List

3501-delete-nodes-from-linked-list-present-in-array

Depth-First Search

0813-all-paths-from-source-to-target
0863-sum-of-distances-in-tree
0922-possible-bipartition
1554-minimum-time-to-collect-all-apples-in-a-tree
1643-number-of-nodes-in-the-sub-tree-with-the-same-label
2364-longest-path-with-different-adjacent-characters

Breadth-First Search

0813-all-paths-from-source-to-target
0922-possible-bipartition
1554-minimum-time-to-collect-all-apples-in-a-tree
1643-number-of-nodes-in-the-sub-tree-with-the-same-label

Union Find

0922-possible-bipartition

Graph

0813-all-paths-from-source-to-target
0863-sum-of-distances-in-tree
0922-possible-bipartition
2364-longest-path-with-different-adjacent-characters

Tree

0863-sum-of-distances-in-tree
1554-minimum-time-to-collect-all-apples-in-a-tree
1643-number-of-nodes-in-the-sub-tree-with-the-same-label
2364-longest-path-with-different-adjacent-characters

Backtracking

0051-n-queens
0813-all-paths-from-source-to-target
3453-generate-binary-strings-without-adjacent-zeros

Bit Manipulation

3453-generate-binary-strings-without-adjacent-zeros
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i

Matrix

1402-count-square-submatrices-with-all-ones
3391-maximum-difference-score-in-a-grid
3461-find-the-minimum-area-to-cover-all-ones-i
3492-count-submatrices-with-equal-frequency-of-x-and-y

Counting

1643-number-of-nodes-in-the-sub-tree-with-the-same-label
3403-minimum-substring-partition-of-equal-character-frequency
3416-sum-of-digit-differences-of-all-pairs
3437-maximum-total-damage-with-spell-casting

Queue

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

Topological Sort

2364-longest-path-with-different-adjacent-characters

Math

3416-sum-of-digit-differences-of-all-pairs
3422-find-the-n-th-value-after-k-seconds

Simulation

3413-find-the-first-player-to-win-k-games-in-a-row
3422-find-the-n-th-value-after-k-seconds
3434-find-the-number-of-distinct-colors-among-the-balls

Combinatorics

3422-find-the-n-th-value-after-k-seconds

Two Pointers

3437-maximum-total-damage-with-spell-casting

Binary Search

3427-special-array-ii
3437-maximum-total-damage-with-spell-casting

Stack

3445-lexicographically-minimum-string-after-removing-stars

Heap (Priority Queue)

3445-lexicographically-minimum-string-after-removing-stars