ZScaler LeetCode Questions
15 questions all-time · 3 easy · 6 medium · 6 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Apply Operations to Make Sum of Array Greater Than or Equal to k Math, Greedy, Enumeration | Medium | 100 | 0.4% |
| 2 | Maximum Strong Pair XOR I Array, Hash Table, Bit Manipulation, Trie, Sliding Window | Easy | 98 | 0.8% |
| 3 | Maximum Strong Pair XOR II Array, Hash Table, Bit Manipulation, Trie, Sliding Window | Hard | 98 | 0.3% |
| 4 | Day of the Year Math, String | Easy | 98 | 0.5% |
| 5 | Largest Number After Digit Swaps by Parity Sorting, Heap (Priority Queue) | Easy | 98 | 0.7% |
| 6 | Optimal Account Balancing Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 89 | 0.5% |
| 7 | Minimum Replacements to Sort the Array Array, Math, Greedy | Hard | 81 | 0.5% |
| 8 | Minimum Increment to Make Array Unique Array, Greedy, Sorting, Counting | Medium | 69 | 0.6% |
| 9 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 69 | 0.5% |
| 10 | Robot Bounded In Circle Math, String, Simulation | Medium | 60 | 0.6% |
| 11 | Number of Divisible Triplet Sums Array, Hash Table | Medium | 60 | 0.7% |
| 12 | Word Ladder Hash Table, String, Breadth-First Search | Hard | 60 | 0.5% |
| 13 | Set Matrix Zeroes Array, Hash Table, Matrix | Medium | 60 | 0.6% |
| 14 | Integer to English Words Math, String, Recursion | Hard | 60 | 0.4% |
| 15 | Reverse Nodes in k-Group Linked List, Recursion | Hard | 60 | 0.7% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.