10 curated coding interview questions directly asked in Akamai technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 525 | Contiguous Array | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 100.0% | 3m |
| 961 | N-Repeated Element in Size 2N Array | Easy | Arrays | Sorting / Prefix / Scan | 79.9% | 100.0% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 87.5% | 3m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 87.5% | all |
| 2235 | Add Two Integers | Easy | Core DSA | Implementation / Reasoning | 88.0% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 62.5% | all |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |