8 curated coding interview questions directly asked in Pure Storage technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 593 | Valid Square | Medium | Strings | Hashing / Sliding Window | 45.0% | 100.0% | 6m |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 87.5% | 6m |
| 2013 | Detect Squares | Medium | Core DSA | Implementation / Reasoning | 52.6% | 87.5% | 6m |
| 1206 | Design Skiplist | Hard | Linked List; Design | Two Pointers; Data Structure Design | 59.7% | 87.5% | all |
| 1668 | Maximum Repeating Substring | Easy | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 41.7% | 75.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 62.5% | all |
| 704 | Binary Search | Easy | Binary Search | Binary Search | 60.9% | 50.0% | all |