2 curated coding interview questions directly asked in Yugabyte technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 100.0% | 3m |
| 882 | Reachable Nodes In Subdivided Graph | Hard | Trees; Graphs | DFS / BFS; BFS / DFS / Topological Sort | 52.1% | 87.5% | all |