8 curated coding interview questions directly asked in Kla technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | all |
| 3584 | Maximum Product of First and Last Elements of a Subsequence | Medium | Arrays | Sorting / Prefix / Scan | 31.5% | 100.0% | all |
| 780 | Reaching Points | Hard | Core DSA | Implementation / Reasoning | 34.4% | 87.5% | all |
| 2106 | Maximum Fruits Harvested After at Most K Steps | Hard | Arrays | Sorting / Prefix / Scan | 61.0% | 87.5% | all |
| 554 | Brick Wall | Medium | Core DSA | Implementation / Reasoning | 56.0% | 87.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 62.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 62.5% | all |