Swiggy placement papers, interview questions, placement process, eligibility criteria, and complete preparation guide for 2025-2026 campus recruitment and hiring.
Swiggy is India’s leading on-demand food delivery and hyperlocal services platform. Founded in 2014 by Sriharsha Majety, Nandan Reddy, and Rahul Jaimini, Swiggy is known for its technology-driven logistics, large-scale food delivery, and digital innovation, serving millions of users across 500+ Indian cities.
Headquarters: Bengaluru, India
Employees: 6,000+ globally
Industry: Food Delivery, Technology
Revenue: $1.1+ Billion USD (2023)
Academic Requirements
Minimum Percentage: 65% or 6.5+ CGPA in 10th, 12th, and graduation
Degree: B.E./B.Tech/M.E./M.Tech/MCA in Computer Science, IT, ECE, EE, or related fields
Year of Study: Final year students and recent graduates (within 1 year)
Backlogs: No active backlogs at the time of selection
Branch Eligibility
Eligible Branches: CS, IT, ECE, EE, and related engineering streams
Programming Focus: Strong skills in Data Structures, Algorithms, and System Design
Experience: Freshers and up to 2 years experience (for entry-level SDE roles)
Additional Criteria
Coding Skills: Proficiency in at least one language (Java, C++, Python, Go)
Gap Years: Maximum 1 year gap allowed
Course Type: Full-time degrees only
Nationality: Indian citizens (for India roles)
Swiggy Placement Papers 2024
Swiggy Placement Papers 2025
Campus Recruitment
College Visits - Through placement cells at top engineering colleges
Direct registration via college coordinators
Off-Campus Drives
Swiggy Careers Portal - Apply online for Software Engineer and other roles
Participate in Swiggy Tech Hunt, hackathons, and coding contests
Online Assessment
Direct Apply - careers.swiggy.com
Register with academic details and resume
Online Coding Assessment (OA) - 90-120 minutes
Format: Conducted on platforms like HackerRank or Swiggy’s internal tool
Success Rate: ~10-15% advance to interviews
Technical Interviews (2-3 rounds, 45-60 min each)
Format: Virtual or onsite
Managerial/Team Fit Interview (1 round, 45 min)
Format: Senior engineer or manager
HR/Offer Discussion (20-30 min)
Format: HR Manager
| Phase | Duration | Key Activities |
|---|---|---|
| Online Assessment | 1 day | Coding, debugging |
| Technical Interviews | 1-2 weeks | DSA, system design |
| Managerial/Team Fit | 2-3 days | Swiggy values, teamwork |
| HR Discussion | Same day | Offer, negotiation |
| Result Declaration | 2-3 days | Offer letter, background check |
Array Manipulation
def max_subarray_sum(arr): max_sum = float('-inf') current_sum = 0 for num in arr: current_sum += num if current_sum > max_sum: max_sum = current_sum if current_sum < 0: current_sum = 0 return max_sumGraph Traversal
Given a graph, find the shortest path between two nodes.
Example: A graph with nodes A, B, C, D, E, F. A is connected to B, C, D. B is connected to C, E. C is connected to D, F. D is connected to E. E is connected to F. Find the shortest path from A to F.
Explanation: The shortest path is A -> B -> C -> D -> E -> F.
Code:
// This is a placeholder for a graph traversal algorithm.// A real implementation would involve using a queue for BFS or a priority queue for Dijkstra's.// For simplicity, let's assume a graph is represented as an adjacency list.// We need to find the shortest path from a source node 'start' to a target node 'end'.// We can use BFS for unweighted graphs or Dijkstra's for weighted graphs.// For this example, let's assume a simple BFS approach.
// Let's define a graph class for clarity.class Graph { int V; // Number of vertices LinkedList<Integer> adj[]; // Adjacency list
Graph(int v) { V = v; adj = new LinkedList[v]; for (int i = 0; i < v; ++i) adj[i] = new LinkedList(); }
void addEdge(int v, int w) { adj[v].add(w); }
// BFS to find the shortest path int shortestPath(int start, int end) { boolean visited[] = new boolean[V]; int dist[] = new int[V]; Arrays.fill(dist, Integer.MAX_VALUE);
Queue<Integer> queue = new LinkedList<>(); visited[start] = true; dist[start] = 0; queue.add(start);
while (!queue.isEmpty()) { int current = queue.poll(); for (Integer neighbor : adj[current]) { if (!visited[neighbor]) { visited[neighbor] = true; dist[neighbor] = dist[current] + 1; queue.add(neighbor); } } } return dist[end]; }}Dynamic Programming
Given a set of coins, find the minimum number of coins to make a given amount.
Example: Coins = [1, 2, 5], Amount = 11
Explanation: The minimum number of coins to make 11 is 3 (5 + 5 + 1).
Code:
int coinChange(int coins[], int amount) { int dp[] = new int[amount + 1]; Arrays.fill(dp, amount + 1); // Initialize with a large value dp[0] = 0; // Base case: 0 coins needed to make 0 amount
for (int i = 1; i <= amount; i++) { for (int coin : coins) { if (coin <= i) { dp[i] = Math.min(dp[i], dp[i - coin] + 1); } } } return dp[amount] > amount ? -1 : dp[amount]; // If amount cannot be formed}Design a Food Delivery Tracking System
Design a Restaurant Recommendation Engine
Customer Focus
Ownership
DSA Fundamentals
Arrays & Strings: Manipulation, searching, sorting
Trees & Graphs: Traversals, shortest path, DFS/BFS
Dynamic Programming: Memoization, tabulation
Hashing: Hash maps, sets
System Design Basics
Food Delivery Architecture: Order management, delivery tracking, payments
Database Design: SQL vs NoSQL, normalization
API Design: RESTful APIs, authentication
Scalability: Load balancing, caching, sharding
“Tell me about yourself”
“Describe a time you worked in a team”
“Why Swiggy?”
“Are you willing to relocate?”
DSA Mastery
Priority: Critical
Time Allocation: 50%
System Design & OOP
Priority: High
Time Allocation: 20%
Swiggy Values
Priority: High
Time Allocation: 20%
Aptitude & Communication
Priority: Medium
Time Allocation: 10%
| Level | Experience | Base Salary | Total Package | Typical Background |
|---|---|---|---|---|
| SDE-1 | New Grad | ₹10-16 LPA | ₹16-22 LPA | Fresh graduates, top colleges |
| SDE-2 | 2-4 years | ₹18-24 LPA | ₹24-30 LPA | 2-4 years experience |
| Senior SDE | 5-8 years | ₹28-40 LPA | ₹40-55 LPA | Senior developers |
| Lead Engineer | 8+ years | ₹55+ LPA | ₹70 LPA+ | Architects, tech leads |
| Role | Level | Total Package | Requirements |
|---|---|---|---|
| QA Engineer | Entry-Mid | ₹7-12 LPA | Testing, automation |
| Product Manager | Mid-Senior | ₹18-35 LPA | Product sense, tech background |
| Data Scientist | Mid | ₹12-25 LPA | ML, analytics |
| DevOps Engineer | Entry-Mid | ₹8-18 LPA | Cloud, automation |
Hiring Trends 2025
Increased Virtual Hiring: More online assessments and interviews
System Design Emphasis: More focus in interviews
Diversity Hiring: Special drives for women and underrepresented groups
Process Changes
Online Assessments: More debugging and scenario-based questions
Team Fit Round: Mandatory for all SDE hires
Faster Offers: Reduced time from interview to offer
New Initiatives
Swiggy Tech Hunt: Coding competition for hiring
Student Programs: Internships, Swiggy Tech Internship
Internal Referrals: Employee referral program
Company Growth
Product Expansion: More engineering and data roles in India
Product Innovation: Food delivery, hyperlocal, fintech
Global Mobility: Opportunities to work abroad
Ready to start your Swiggy preparation? Focus on DSA, system design, and Swiggy company values. Practice mock interviews and build strong STAR stories.
Pro Tip: Consistent practice on LeetCode and HackerRank is key. Understand Swiggy’s values and be ready to demonstrate them in behavioral rounds.