DSA Doctor
Verified Company Vault
Lucid DSA Interview Questions
6 curated coding interview questions directly asked in Lucid technical rounds, sorted by frequency with recency and difficulty diagnostics.
6
Total Questions
2 (33%)
Easy Problems
3 (50%)
Medium Problems
1 (17%)
Hard Problems
🔥 Most Tested Topics:
Trees (2)Dynamic Programming (1)Arrays (1)Strings (1)Graphs (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2603 | Collect Coins in a Tree | Hard | Trees; Dynamic Programming | DFS / BFS; State Transition | 40.1% | 100.0% | all |
| 1742 | Maximum Number of Balls in a Box | Easy | Arrays | Sorting / Prefix / Scan | 74.9% | 100.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 62.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | all |