7 curated coding interview questions directly asked in Lime technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 100.0% | 3m |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 100.0% | all |
| 785 | Is Graph Bipartite? | Medium | Graphs | BFS / DFS / Topological Sort | 59.3% | 87.5% | all |
| 1951 | All the Pairs With the Maximum Number of Common Followers | Medium | Arrays | Sorting / Prefix / Scan | 69.7% | 87.5% | all |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy | Arrays | Sorting / Prefix / Scan | 76.6% | 87.5% | all |
| 2545 | Sort the Students by Their Kth Score | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 86.0% | 87.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 87.5% | all |