Swiggy LeetCode Questions
36 questions all-time · 6 easy · 24 medium · 6 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Maximize Area of Square Hole in Grid Array, Sorting | Medium | 100 | 0.6% |
| 2 | Minimum Value to Get Positive Step by Step Sum Array, Prefix Sum | Easy | 96 | 0.6% |
| 3 | Count Good Meals Array, Hash Table | Medium | 93 | 0.3% |
| 4 | Next Greater Element I Array, Hash Table, Stack, Monotonic Stack | Easy | 79 | 0.8% |
| 5 | Happy Number Hash Table, Math, Two Pointers | Easy | 79 | 0.6% |
| 6 | Course Schedule Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 73 | 0.5% |
| 7 | Edit Distance String, Dynamic Programming | Medium | 73 | 0.6% |
| 8 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 73 | 0.6% |
| 9 | Merge Sorted Array Array, Two Pointers, Sorting | Easy | 66 | 0.6% |
| 10 | Integer to Roman Hash Table, Math, String | Medium | 66 | 0.7% |
| 11 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 66 | 0.7% |
| 12 | Fair Candy Swap Array, Hash Table, Binary Search, Sorting | Easy | 66 | 0.7% |
| 13 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 66 | 0.5% |
| 14 | Koko Eating Bananas Array, Binary Search | Medium | 66 | 0.5% |
| 15 | Distinct Subsequences String, Dynamic Programming | Hard | 66 | 0.5% |
| 16 | Unique Binary Search Trees Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree | Medium | 66 | 0.6% |
| 17 | Count Days Without Meetings Array, Sorting | Medium | 66 | 0.5% |
| 18 | Longest Consecutive Sequence Array, Hash Table, Union-Find | Medium | 66 | 0.5% |
| 19 | Sort Colors Array, Two Pointers, Sorting | Medium | 56 | 0.7% |
| 20 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 56 | 0.5% |
| 21 | First Missing Positive Array, Hash Table | Hard | 56 | 0.4% |
| 22 | Subarray Sum Equals K Array, Hash Table, Prefix Sum | Medium | 56 | 0.5% |
| 23 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 56 | 0.5% |
| 24 | Immediate Food Delivery II Database | Medium | 56 | 0.6% |
| 25 | Maximum Score From Removing Substrings String, Stack, Greedy | Medium | 56 | 0.7% |
| 26 | K Closest Points to Origin Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect | Medium | 56 | 0.7% |
| 27 | Minimum Number of Work Sessions to Finish the Tasks Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 56 | 0.4% |
| 28 | Two City Scheduling Array, Greedy, Sorting | Medium | 56 | 0.7% |
| 29 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 56 | 0.7% |
| 30 | Maximum Product Subarray Array, Dynamic Programming | Medium | 56 | 0.4% |
| 31 | Sum of Two Integers Math, Bit Manipulation | Medium | 56 | 0.6% |
| 32 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 56 | 0.5% |
| 33 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 56 | 0.5% |
| 34 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 56 | 0.4% |
| 35 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 56 | 0.4% |
| 36 | Design Twitter Hash Table, Linked List, Design, Heap (Priority Queue) | Medium | 56 | 0.4% |
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.