Swiggy Interview Questions — 31 DSA Problems

31 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Swiggy LeetCode questions for software engineering interviews.

• Maximize Area of Square Hole in Grid (MEDIUM) — Array, Sorting
• Minimum Value to Get Positive Step by Step Sum (EASY) — Array, Prefix Sum
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Valid Parentheses (EASY) — String, Stack
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Next Greater Element I (EASY) — Array, Hash Table, Stack, Monotonic Stack
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Happy Number (EASY) — Hash Table, Math, Two Pointers
• Fair Candy Swap (EASY) — Array, Hash Table, Binary Search, Sorting
• Count Good Meals (MEDIUM) — Array, Hash Table
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Maximum Score From Removing Substrings (MEDIUM) — String, Stack, Greedy
• Immediate Food Delivery II (MEDIUM) — Database
• Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
• K Closest Points to Origin (MEDIUM) — Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect
• Minimum Number of Work Sessions to Finish the Tasks (MEDIUM) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
• Two City Scheduling (MEDIUM) — Array, Greedy, Sorting
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Subarray Sum Equals K (MEDIUM) — Array, Hash Table, Prefix Sum
• First Missing Positive (HARD) — Array, Hash Table
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
• Majority Element (EASY) — Array, Hash Table, Divide and Conquer, Sorting, Counting
• Maximum Length of Pair Chain (MEDIUM) — Array, Dynamic Programming, Greedy, Sorting
• Subsets II (MEDIUM) — Array, Backtracking, Bit Manipulation
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Edit Distance (MEDIUM) — String, Dynamic Programming