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

LeetCode Topics

Hash Table

0127-word-ladder
0347-top-k-frequent-elements
0438-find-all-anagrams-in-a-string
3329-find-the-length-of-the-longest-common-prefix

String

0127-word-ladder
0438-find-all-anagrams-in-a-string
0539-minimum-time-difference
2076-sum-of-digits-of-string-after-convert
2800-minimum-string-length-after-removing-substrings
3329-find-the-length-of-the-longest-common-prefix

Sliding Window

0438-find-all-anagrams-in-a-string

Array

0200-number-of-islands
0347-top-k-frequent-elements
0539-minimum-time-difference
1036-rotting-oranges
1073-number-of-enclaves
1325-path-with-maximum-probability
1380-number-of-closed-islands
2006-find-the-student-that-will-replace-the-chalk
2132-convert-1d-array-into-2d-array
2155-find-missing-observations
2503-longest-subarray-with-maximum-bitwise-and
2616-maximal-score-after-applying-k-operations
3329-find-the-length-of-the-longest-common-prefix

Matrix

0200-number-of-islands
1036-rotting-oranges
1073-number-of-enclaves
1380-number-of-closed-islands
2132-convert-1d-array-into-2d-array

Simulation

2006-find-the-student-that-will-replace-the-chalk
2076-sum-of-digits-of-string-after-convert
2132-convert-1d-array-into-2d-array
2155-find-missing-observations
2800-minimum-string-length-after-removing-substrings

Binary Search

2006-find-the-student-that-will-replace-the-chalk

Prefix Sum

2006-find-the-student-that-will-replace-the-chalk

Depth-First Search

0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0572-subtree-of-another-tree
0744-network-delay-time
0801-is-graph-bipartite
0820-find-eventual-safe-states
1073-number-of-enclaves
1380-number-of-closed-islands
1484-linked-list-in-binary-tree

Breadth-First Search

0127-word-ladder
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0744-network-delay-time
0801-is-graph-bipartite
0820-find-eventual-safe-states
1036-rotting-oranges
1073-number-of-enclaves
1380-number-of-closed-islands
1484-linked-list-in-binary-tree

Union Find

0200-number-of-islands
0801-is-graph-bipartite
1073-number-of-enclaves
1380-number-of-closed-islands

Math

0539-minimum-time-difference
2050-count-good-numbers
2155-find-missing-observations
2903-insert-greatest-common-divisors-in-linked-list

Divide and Conquer

0347-top-k-frequent-elements

Sorting

0347-top-k-frequent-elements
0539-minimum-time-difference

Heap (Priority Queue)

0347-top-k-frequent-elements
0744-network-delay-time
1325-path-with-maximum-probability
2616-maximal-score-after-applying-k-operations

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements

Quickselect

0347-top-k-frequent-elements

Linked List

0725-split-linked-list-in-parts
1484-linked-list-in-binary-tree
2903-insert-greatest-common-divisors-in-linked-list

Tree

0572-subtree-of-another-tree
1484-linked-list-in-binary-tree

Binary Tree

0572-subtree-of-another-tree
1484-linked-list-in-binary-tree

Number Theory

2903-insert-greatest-common-divisors-in-linked-list

Bit Manipulation

2503-longest-subarray-with-maximum-bitwise-and

Brainteaser

2503-longest-subarray-with-maximum-bitwise-and

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Trie

3329-find-the-length-of-the-longest-common-prefix

Recursion

2050-count-good-numbers

Stack

2800-minimum-string-length-after-removing-substrings

Graph

0207-course-schedule
0210-course-schedule-ii
0744-network-delay-time
0801-is-graph-bipartite
0820-find-eventual-safe-states
1325-path-with-maximum-probability
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0820-find-eventual-safe-states
2090-number-of-ways-to-arrive-at-destination

Greedy

2616-maximal-score-after-applying-k-operations

Shortest Path

0744-network-delay-time
1325-path-with-maximum-probability
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination

Dynamic Programming

1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination