2 curated coding interview questions directly asked in Livspace technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 111 | Minimum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 52.9% | 100.0% | all |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | Arrays | Sorting / Prefix / Scan | 61.5% | 87.5% | all |