DSA Doctor
Verified Company Vault
Zeta DSA Interview Questions
31 curated coding interview questions directly asked in Zeta technical rounds, sorted by frequency with recency and difficulty diagnostics.
31
Total Questions
0 (0%)
Easy Problems
20 (65%)
Medium Problems
11 (35%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (10)Arrays (8)Strings (6)Trees (6)Dynamic Programming (5)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2896 | Apply Operations to Make Two Strings Equal | Medium | Strings | Hashing / Sliding Window | 27.7% | 100.0% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 87.5% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 75.0% | all |
| 1011 | Capacity To Ship Packages Within D Days | Medium | Binary Search | Binary Search | 73.9% | 75.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 75.0% | all |
| 132 | Palindrome Partitioning II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 37.1% | 75.0% | all |
| 546 | Remove Boxes | Hard | Core DSA | Implementation / Reasoning | 49.4% | 75.0% | all |
| 502 | IPO | Hard | Core DSA | Implementation / Reasoning | 53.5% | 62.5% | all |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 62.5% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 250 | Count Univalue Subtrees | Medium | Trees | DFS / BFS | 57.5% | 62.5% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 62.5% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 62.5% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 62.5% | all |
| 475 | Heaters | Medium | Core DSA | Implementation / Reasoning | 41.9% | 62.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | all |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | Core DSA | Implementation / Reasoning | 56.9% | 62.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | Arrays | Sorting / Prefix / Scan | 51.0% | 62.5% | all |
| 968 | Binary Tree Cameras | Hard | Trees | DFS / BFS | 47.9% | 62.5% | all |
| 698 | Partition to K Equal Sum Subsets | Medium | Arrays; Dynamic Programming; Backtracking | Sorting / Prefix / Scan; State Transition; Backtracking | 38.6% | 62.5% | all |
| 375 | Guess Number Higher or Lower II | Medium | Core DSA | Implementation / Reasoning | 52.8% | 62.5% | all |
| 2381 | Shifting Letters II | Medium | Strings | Hashing / Sliding Window | 53.7% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 62.5% | all |
| 979 | Distribute Coins in Binary Tree | Medium | Trees; Dynamic Programming | DFS / BFS; State Transition | 77.3% | 62.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 62.5% | all |
| 3607 | Power Grid Maintenance | Medium | Core DSA | Implementation / Reasoning | 56.2% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
