DSA Doctor
Verified Company Vault
Mongodb DSA Interview Questions
23 curated coding interview questions directly asked in Mongodb technical rounds, sorted by frequency with recency and difficulty diagnostics.
23
Total Questions
3 (13%)
Easy Problems
14 (61%)
Medium Problems
6 (26%)
Hard Problems
🔥 Most Tested Topics:
Arrays (8)Core DSA (4)Trees (4)Strings (4)Design (2)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1146 | Snapshot Array | Medium | Arrays | Sorting / Prefix / Scan | 36.8% | 100.0% | 3m |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 100.0% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 87.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | 3m |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 75.0% | 6m |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 75.0% | 6m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 75.0% | 6m |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 75.0% | 6m |
| 57 | Insert Interval | Medium | Arrays | Sorting / Prefix / Scan | 45.2% | 75.0% | all |
| 1242 | Web Crawler Multithreaded | Medium | Core DSA | Implementation / Reasoning | 51.2% | 75.0% | all |
| 2034 | Stock Price Fluctuation | Medium | Core DSA | Implementation / Reasoning | 49.0% | 75.0% | all |
| 2759 | Convert JSON String to Object | Hard | Strings | Hashing / Sliding Window | 62.0% | 75.0% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 75.0% | all |
| 617 | Merge Two Binary Trees | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 79.1% | 62.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | all |
| 642 | Design Search Autocomplete System | Hard | Binary Search; Design | Binary Search; Data Structure Design | 50.0% | 62.5% | all |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | Trees | DFS / BFS | 83.0% | 62.5% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 62.5% | all |
| 140 | Word Break II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 55.6% | 62.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 62.5% | all |