Swiggy Coding Interview Questions
25 Swiggy coding interview problems with full optimal solutions — 10 easy, 11 medium, 4 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Swiggy interviewer values, and a FAQ section.
Showing 10 problems of 25
- #1easyfoundational
1. Two Sum
Find two indices in an array whose values sum to a target.
- #2easyfoundational
2. Valid Parentheses
Check whether a string of brackets is well-formed.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Compact a sorted array in-place so each value appears once, returning the new length.
- #5easyfoundational
5. Merge Sorted Array
Merge nums2 into nums1 in-place so the result is sorted non-decreasing.
- #6easyfoundational
6. Best Time to Buy and Sell Stock
Find the max profit from one buy-sell of a stock given daily prices.
- #7easyfoundational
7. Single Number
In an array where every element appears twice except one, find the unique value.
- #8easyfoundational
8. Linked List Cycle
Detect whether a singly linked list contains a cycle.
- #9easyfoundational
9. Min Stack
Design a stack that returns the minimum element in O(1).
- #10easyfoundational
10. Reverse Linked List
Reverse the direction of every pointer in a singly linked list.