Swiggy interview questions
Online test → System design → Technical → Managerial·69% entry level
DSA
Showing 34 of 60 reported in this area
Find the Lowest Common Ancestor (LCA) in a Binary Tree
Check if a binary tree is a balanced BST
Add two numbers represented as linked lists
Find all Stepping Numbers within a given range
Write code to evaluate an arithmetic expression
Find the longest palindromic substring in a given string.
Find the next greater element for every element in an array
Find the number of unique paths in a 2D grid with obstacles.
Search an element in a row-wise and column-wise sorted matrix
Given a string, print all subsets (subsequences) of the string
Print all the nodes visible from the top view of a binary tree.
Find all unique triplets in an array such that their sum is zero
Construct a binary tree from preorder and inorder traversal arrays
Find the total number of possible Binary Search Trees for a given N
Count the number of binary strings of length N without consecutive 1s.
Given an infinite stream of numbers, find the median at each insertion
Design a stack that supports getMin() in O(1) time and O(1) extra space
Find an element in a sorted array that has been rotated any number of times
Stock Buy Sell to Maximize Profit (maximize profit over given stock prices)
Find the row with the maximum number of 1s in a row-wise sorted binary matrix
Count the minimum number of fountains to be activated to cover the entire garden
Rotate a given square matrix by 90 degrees clockwise and print the resulting matrix.
Given a string containing '(', ')' and '*', check if it is a valid parenthesis string
Given an array representing elevation map, compute how much rain water can be trapped
Given a sorted array, count the frequency of all distinct numbers in less than O(n) time.
Given gas and cost arrays, determine if you can complete the circuit and return the starting index
Given an array, print all possible contiguous subarrays whose sum is divisible by a given number x.
Given a sorted array where every element is repeated except one, find the non-repeated element in O(log n) time
Given an infinite stream of integers arriving in a sorted manner, check if a given number is present in the stream
Given two sequences, find the maximum number of bridges that can be built without crossing (Building Bridges problem).
Given packet sizes of 6, 9, and 20 pens, determine whether a given number N of pens can be sold if only full packets can be sold.
Given N lines defined by (x1, x2) intervals, find the point where the maximum number of lines intersect when drawing a vertical line.
Given ratings of programmers, pair them such that the sum of absolute differences in ratings (bias amount) across all pairs is minimized.
Design and implement an LRU (Least Recently Used) Cache, discussing suitable data structures and time complexities for different operations.
CS fundamentals
Showing 19 of 34 reported in this area
What is the Two-Phase Commit protocol?
Why would you choose MongoDB over other databases?
Given 4 processes and 4 resources, determine if deadlock can occur
Compare O(2^n) and O(n!) time complexities and prove which is better
Explain synchronization with an example of concurrent file access in write mode
What is the difference between concurrent programming and parallel programming?
What are block ciphers and AES? Discuss security implications of Polybius Cipher
Which page replacement policy is used for swapping pages? Explain and implement LRU
What are the differences between Node.js and Express.js for server-side development?
What data structure does a DNS server use and how does DNS search for an IP address?
When should asynchronous programming be used versus synchronous programming in microservices?
What are the differences between ReactJS and Vanilla JavaScript, and why would you prefer React?
Explain what happens in the background when a user types a URL like www.facebook.com in a browser
What are signal handlers in an operating system, and what happens when you run kill -9 on a process?
Explain the probability concepts behind Markov Chains and how state transition probabilities are computed.
What are the important hyperparameters in Gradient Boosting Trees and how do they affect model performance?
How does Gradient Boosting Trees work, and how are residuals calculated at each iteration in a GBT classifier?
Given functional dependencies, how do you check whether the dependencies are valid by modeling them as a DAG and detecting cycles?
Given a server containing a 900MB file and a client machine with only 100MB available memory, how would you sort the file on the client?
System design
Showing 5 of 12 reported in this area
Design an online sports tournament management system
Design a database schema for a food shop and optimize it for minimal complexity
Design and implement a Snake and Ladder game with extensible object-oriented design
Design a Hotel Room Booking System using object-oriented principles. Define classes, methods, and entities.
Design a medicine inventory system where an alarm is raised if the stock of any medicine goes below a threshold.
Puzzles
2 questions reported in this area
There are multiple bags of coins with one bag having fake coins. Using a balance, determine the bag with fake coins
Given a function f6() that returns a random number from 1 to 6 with equal probability, implement f12() that returns a random number from 1 to 12 with equal probability.
Showing 60 of 104 questions. Ranked by how often the same question came back across reports.
Practise a Swiggy-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Swiggy ask?
Candidate interview reports most often cover DSA (56%) and CS fundamentals (31%).
How many rounds does Swiggy interview have?
Candidate interview reports show an average of 3.5 rounds per experience, with a typical sequence of Online test → System design → Technical → Managerial. Individual interview paths can vary.
Is the Swiggy interview hard?
Among questions with a reported difficulty, the mix is easy 16%, medium 69%, hard 15%.