16 curated coding interview questions directly asked in Zscaler technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 100.0% | 3m |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 100.0% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 6m |
| 2932 | Maximum Strong Pair XOR I | Easy | Arrays | Sorting / Prefix / Scan | 76.1% | 100.0% | all |
| 2935 | Maximum Strong Pair XOR II | Hard | Arrays | Sorting / Prefix / Scan | 32.7% | 100.0% | all |
| 1154 | Day of the Year | Easy | Core DSA | Implementation / Reasoning | 50.0% | 100.0% | all |
| 3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | Medium | Arrays | Sorting / Prefix / Scan | 44.4% | 100.0% | all |
| 2231 | Largest Number After Digit Swaps by Parity | Easy | Core DSA | Implementation / Reasoning | 65.4% | 100.0% | all |
| 465 | Optimal Account Balancing | Hard | Core DSA | Implementation / Reasoning | 50.5% | 87.5% | all |
| 2366 | Minimum Replacements to Sort the Array | Hard | Arrays | Sorting / Prefix / Scan | 53.1% | 87.5% | all |
| 945 | Minimum Increment to Make Array Unique | Medium | Arrays | Sorting / Prefix / Scan | 60.7% | 75.0% | all |
| 1041 | Robot Bounded In Circle | Medium | Core DSA | Implementation / Reasoning | 56.5% | 62.5% | all |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Core DSA | Implementation / Reasoning | 65.9% | 62.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | all |
| 2964 | Number of Divisible Triplet Sums | Medium | Arrays | Sorting / Prefix / Scan | 67.6% | 62.5% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 62.5% | all |