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 4 problems of 25
- #22hardsometimes
22. Median of Two Sorted Arrays
Median of Two Sorted Arrays is the classic logarithmic-time partition problem: given two already-sorted arrays, return the median of their combined order without actually merging them. Swiggy candidates report it in senior late-loop rounds, where the interviewer is less interested in the final code than in whether you can derive and defend the partition invariant — the same robust-statistics thinking behind p50 delivery-time metrics that a food-delivery platform lives on.
- #23hardfoundational
23. Merge k Sorted Lists
Merge k sorted linked lists into one sorted linked list.
- #24hardfoundational
24. Trapping Rain Water
Compute how much water is trapped between bars of given heights.
- #25hardfoundational
25. Minimum Window Substring
Find the shortest substring of s that contains every character of t (with multiplicities).