•PRACTICE
Counting Interview Questions
7 Counting problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.
Filter by company
Clear all ✕Filter by topic
Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
🔒
to save your progress.
| ✓ 0 | Problem | Difficulty | Companies | Breakdown / Solution | LeetCode |
|---|---|---|---|---|---|
| Majority Element | Easy | 3 companies | View breakdown → | ||
| RLE Iterator | Medium | 1 companies | View breakdown → | ||
| Rank Teams by Votes | MEDIUM | 1 companies | View breakdown → | ||
| Reorganize String | MEDIUM | 1 companies | View breakdown → | ||
| Maximum Palindromes After Operations | MEDIUM | 1 companies | View breakdown → | ||
| Top K Frequent Words | MEDIUM | 1 companies | View breakdown → | ||
| Pairs of Songs With Total Durations Divisible by 60 | MEDIUM | 1 companies | View breakdown → |
Practice with a Mock Interview
Solve these Counting problems under real interview pressure with our AI interviewer.
Start Mock Interview →