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

LeetCode Topics

Array

0136-single-number
0150-evaluate-reverse-polish-notation
0448-find-all-numbers-disappeared-in-an-array
0485-max-consecutive-ones
0636-exclusive-time-of-functions
0645-set-mismatch
1267-count-servers-that-communicate
1365-how-many-numbers-are-smaller-than-the-current-number
1441-build-an-array-with-stack-operations
1470-shuffle-the-array
2089-find-target-indices-after-sorting-array
2778-sum-of-squares-of-special-elements
3736-minimum-moves-to-equal-array-elements-iii

Hash Table

0448-find-all-numbers-disappeared-in-an-array
0645-set-mismatch
1365-how-many-numbers-are-smaller-than-the-current-number

Bit Manipulation

0136-single-number
0645-set-mismatch

Sorting

0645-set-mismatch
1365-how-many-numbers-are-smaller-than-the-current-number
2089-find-target-indices-after-sorting-array

Counting Sort

1267-count-servers-that-communicate
1365-how-many-numbers-are-smaller-than-the-current-number

Stack

0150-evaluate-reverse-polish-notation
0636-exclusive-time-of-functions
1441-build-an-array-with-stack-operations

Simulation

1441-build-an-array-with-stack-operations

Math

0150-evaluate-reverse-polish-notation
3736-minimum-moves-to-equal-array-elements-iii

Tree

0101-symmetric-tree

Depth-First Search

0101-symmetric-tree
1267-count-servers-that-communicate

Breadth-First Search

0101-symmetric-tree
1267-count-servers-that-communicate

Binary Tree

0101-symmetric-tree

Union-Find

1267-count-servers-that-communicate

Matrix

1267-count-servers-that-communicate

Binary Search

2089-find-target-indices-after-sorting-array

Enumeration

2778-sum-of-squares-of-special-elements