15 curated coding interview questions directly asked in Pocket Gems technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 100.0% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 100.0% | all |
| 600 | Non-negative Integers without Consecutive Ones | Hard | Core DSA | Implementation / Reasoning | 42.4% | 100.0% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 100.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 100.0% | all |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 100.0% | all |
| 214 | Shortest Palindrome | Hard | Strings | Hashing / Sliding Window | 42.5% | 100.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 100.0% | all |
| 269 | Alien Dictionary | Hard | Graphs | BFS / DFS / Topological Sort | 37.2% | 100.0% | all |
| 772 | Basic Calculator III | Hard | Stack / Queue | Monotonic Stack / Simulation | 53.3% | 100.0% | all |
| 285 | Inorder Successor in BST | Medium | Trees | DFS / BFS | 51.2% | 100.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 100.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 100.0% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 100.0% | all |
| 442 | Find All Duplicates in an Array | Medium | Arrays | Sorting / Prefix / Scan | 76.9% | 100.0% | all |