•PRACTICE
Enumeration Interview Questions
6 Enumeration problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.
Filter by company
Clear all ✕Filter by topic
Array (240)Backtracking (22)BFS (23)Binary Search (44)Binary Tree (23)Bit Manipulation (20)Breadth-First Search (33)Counting (10)Data Stream (8)Database (6)Depth-First Search (49)Design (46)DFS (24)Divide and Conquer (9)Doubly-Linked List (5)DP (10)Dynamic Programming (55)Enumeration (6)Geometry (5)Graph (15)Graph Theory (13)Greedy (43)Hash Table (113)Heap (12)Heap (Priority Queue) (23)Linked List (18)Math (49)Matrix (28)Monotonic Stack (9)Ordered Set (9)Prefix Sum (20)Queue (13)Recursion (10)Simulation (20)Sliding Window (26)Sorting (64)Stack (32)String (112)Topological Sort (9)Tree (41)Trie (12)Two Pointers (39)Union Find (6)Union-Find (13)
🔒
to save your progress.
| ✓ 0 | Problem | Difficulty | Companies | Breakdown / Solution | LeetCode |
|---|---|---|---|---|---|
| Consecutive Numbers Sum | Hard | 1 companies | View breakdown → | ||
| Longest Mountain in Array | MEDIUM | 2 companies | View breakdown → | ||
| Maximum Score with Co-Prime Element | HARD | 1 companies | View breakdown → | ||
| Smallest Divisible Digit Product I | EASY | 1 companies | View breakdown → | ||
| Removing Minimum Number of Magic Beans | Medium | 1 companies | View breakdown → | ||
| Minimize Result by Adding Parentheses to Expression | Medium | 1 companies | View breakdown → |
Practice with a Mock Interview
Solve these Enumeration problems under real interview pressure with our AI interviewer.
Start Mock Interview →