DSA Doctor
Verified Company Vault
Swiggy DSA Interview Questions
40 curated coding interview questions directly asked in Swiggy technical rounds, sorted by frequency with recency and difficulty diagnostics.
40
Total Questions
9 (22%)
Easy Problems
25 (62%)
Medium Problems
6 (15%)
Hard Problems
🔥 Most Tested Topics:
Arrays (16)Core DSA (11)Strings (6)Trees (5)Design (2)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3169 | Count Days Without Meetings | Medium | Greedy | Greedy | 48.1% | 100.0% | 6m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 100.0% | 6m |
| 1711 | Count Good Meals | Medium | Core DSA | Implementation / Reasoning | 32.8% | 100.0% | 6m |
| 1413 | Minimum Value to Get Positive Step by Step Sum | Easy | Arrays | Sorting / Prefix / Scan | 64.7% | 100.0% | all |
| 2943 | Maximize Area of Square Hole in Grid | Medium | Core DSA | Implementation / Reasoning | 61.9% | 87.5% | 6m |
| 355 | Design Twitter | Medium | Design | Data Structure Design | 44.7% | 87.5% | 6m |
| 96 | Unique Binary Search Trees | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 63.7% | 87.5% | 6m |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 87.5% | 6m |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 75.0% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 75.0% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 75.0% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 75.0% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 62.5% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 62.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 62.5% | all |
| 888 | Fair Candy Swap | Easy | Core DSA | Implementation / Reasoning | 65.0% | 62.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 50.0% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 50.0% | all |
| 1174 | Immediate Food Delivery II | Medium | Core DSA | Implementation / Reasoning | 56.0% | 50.0% | all |
| 1717 | Maximum Score From Removing Substrings | Medium | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 66.5% | 50.0% | all |
| 973 | K Closest Points to Origin | Medium | Core DSA | Implementation / Reasoning | 69.0% | 50.0% | all |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | Medium | Arrays | Sorting / Prefix / Scan | 34.8% | 50.0% | all |
| 1029 | Two City Scheduling | Medium | Core DSA | Implementation / Reasoning | 68.5% | 50.0% | all |
| 523 | Continuous Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 31.4% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 50.0% | all |
| 371 | Sum of Two Integers | Medium | Arrays | Sorting / Prefix / Scan | 55.5% | 50.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 50.0% | all |
| 115 | Distinct Subsequences | Hard | Core DSA | Implementation / Reasoning | 51.9% | 50.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |