14 curated coding interview questions directly asked in Moloco technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 100.0% | 6m |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 100.0% | 6m |
| 1381 | Design a Stack With Increment Operation | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 79.9% | 100.0% | all |
| 1048 | Longest String Chain | Medium | Strings | Hashing / Sliding Window | 63.0% | 100.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 100.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 75.0% | all |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 75.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | all |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 75.0% | all |
| 130 | Surrounded Regions | Medium | Core DSA | Implementation / Reasoning | 45.3% | 75.0% | all |
| 2116 | Check if a Parentheses String Can Be Valid | Medium | Strings | Hashing / Sliding Window | 45.2% | 75.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 75.0% | all |
| 305 | Number of Islands II | Hard | Graphs | BFS / DFS / Topological Sort | 40.6% | 75.0% | all |