4 curated coding interview questions directly asked in Cohesity technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 100.0% | all |
| 2251 | Number of Flowers in Full Bloom | Hard | Core DSA | Implementation / Reasoning | 57.9% | 87.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 87.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 87.5% | all |