Swiggy interview process (2026)

Round-by-round breakdown of the Swiggy software engineering interview across 4 levels and 16 rounds: interview mode, sample questions, and worked solutions.

Swiggy salary & ratings · All interview processes

SDE Intern / Software Development Engineer Intern (6-month, Internship-cum-PPO)

Difficulty: Medium · Timeline: ~2-4 weeks · Recommended prep: 6-10 weeks · Cooldown: 6-12 months

  1. Round 0: Online Assessment (Coding)

    Assessment · 90-120 minutes · difficulty 2/5 · elimination round

    Mode of interview: Online assessment · HackerRank

    Sample question: Shortest Path in an Unweighted Graph — Given an undirected, unweighted graph with n nodes and m edges, find the length of the shortest path (number of edges) between a given source and destination node. Return -1 if no path exists. Solve with BFS (Dijkstra only if edges are weighted).

  2. Round 1: Technical Interview 1 (DSA + CS Fundamentals)

    Onsite · 45-60 minutes · difficulty 2/5 · elimination round

    Mode of interview: Onsite or virtual onsite interview

    Sample question: Longest Substring Without Repeating Characters (Sliding Window) — Given a string, return the length of the longest substring that contains no repeating characters. Solve with a sliding window and a last-seen index map. This is the canonical form of the sliding-window problem repeatedly reported in Swiggy's OA.

  3. Round 2: Technical Interview 2 / Hiring-Manager Round

    Onsite · 45-60 minutes · difficulty 3/5 · elimination round

    Mode of interview: Onsite or virtual onsite interview

  4. Round 3: HR / Managerial Discussion

    Behavioral · 20-40 minutes · difficulty 1/5

    Mode of interview: Live behavioral interview

SDE-1 (Software Development Engineer I)

Difficulty: Medium · Timeline: ~2-3 weeks · Recommended prep: 6-10 weeks · Cooldown: ~6 months

  1. Round 0: Online Assessment (Coding)

    Assessment · 60-90 minutes · difficulty 2/5 · elimination round

    Mode of interview: Online assessment · HackerRank

    Sample question: Maximum Length of Pair Chain — You are given n pairs [a, b] with a < b. A pair (c, d) can follow (a, b) only if b < c. Choose the longest chain of pairs where each next pair follows the previous. Return the maximum chain length.

  2. Round 1: DSA / Problem-Solving Interview (PSDS)

    Phone · 45-60 minutes · difficulty 3/5 · elimination round

    Mode of interview: Remote phone or video interview

    Sample question: Detect Cycle in a Directed Graph — Given a directed graph with n nodes (0..n-1) and m edges, determine whether it contains a cycle. (Swiggy framed this as validating Spring-bean dependency wiring: given bean dependencies, report whether a dependency cycle exists.) Input: first line n m, then m lines 'u v'. Output 'true' if a cycle exists, else 'false'.

  3. Round 2: Machine Coding / Low-Level Design (LLD)

    System_design · 60-90 minutes · difficulty 3/5

    Mode of interview: Live system design interview

    Sample question: Design Splitwise (expense-sharing) — Design and implement a Splitwise-style expense-sharing system (LLD / machine coding). Support adding users and groups, recording an expense split among members (equal / exact / percentage), computing net balances (who owes whom), and settling up. Discuss the class model, data structures, and trade-offs.

  4. Round 3: Hiring Manager Round

    Behavioral · 30-45 minutes · difficulty 2/5

    Mode of interview: Live behavioral interview

SDE-2 (Software Development Engineer II)

Difficulty: Hard · Timeline: ~3-4 weeks · Recommended prep: 8-12 weeks · Cooldown: ~6 months

  1. Round 0: Online Assessment (Coding)

    Assessment · 60-90 minutes · difficulty 3/5 · elimination round

    Mode of interview: Online assessment · HackerRank

    Sample question: Count of Subsets With Given Sum — Given an array of n non-negative integers and a target sum, count the number of subsets whose elements sum exactly to the target. (Swiggy extends this to arrays with negative numbers as a follow-up.) Input: n, then n integers, then target. Output: the count.

  2. Round 1: DSA Technical Round (+ language internals)

    Phone · 45-60 minutes · difficulty 3/5 · elimination round

    Mode of interview: Remote phone or video interview

    Sample question: Longest Valid Parentheses — Given a string containing only '(' and ')', return the length of the longest substring that is a well-formed (valid) parentheses sequence.

  3. Round 2: Low-Level Design / Machine Coding

    System_design · 60-90 minutes · difficulty 3/5

    Mode of interview: Live system design interview

    Sample question: Design a Restaurant Catalog System (variants & add-ons) — Design (LLD) a catalog for a food-delivery platform: Restaurants, Items, Categories, VariantGroups (e.g. Size), Variants (S/M/L), AddOnGroups (e.g. Extra Cheese), and AddOns (White/Yellow Cheese). Item price varies by the selected variant, and add-on prices themselves vary by the chosen variant. Model the classes/relationships and price-resolution logic; discuss extensibility, robustness, and fallbacks.

  4. Round 3: Hiring Manager Round

    Behavioral · 30-45 minutes · difficulty 2/5

    Mode of interview: Live behavioral interview

SDE-3 (Software Development Engineer III)

Difficulty: Hard · Timeline: ~1 month · Recommended prep: 10-14 weeks · Cooldown: ~6-12 months

  1. Round 0: Machine Coding / Screening Assignment

    Assessment · 90-120 minutes · difficulty 3/5 · elimination round

    Mode of interview: Online assessment

    Sample question: Design a Music Track Platform (machine coding) — Machine-coding round: build a music-track platform in the style of 8tracks.com. Provide CRUD APIs for tracks/playlists and a trending-tracks view, with strong emphasis on database schema design, clean/extensible code structure, and unit-test coverage. Discuss the entity model and API contracts.

  2. Round 1: Problem Solving / DSA

    Phone · 45-60 minutes · difficulty 3/5

    Mode of interview: Remote phone or video interview

    Sample question: String Expansion (prefix-repeat) — Given a string of the form abc{1}p{2}, expand it: remove each {n} and repeat the ENTIRE string built so far n times, then continue. Examples: ab{2}c -> ababc; xy{2}bd{2} -> xyxybdxyxybd; a{3}b{2} -> aaabaaab. (Note: this repeats the whole accumulated prefix, unlike LeetCode 394's local-segment k[encoded] decoding.) Input: one line. Output: the expanded string.

  3. Round 2: High-Level / System Design (HLD)

    System_design · 60 minutes · difficulty 4/5

    Mode of interview: Live system design interview

    Sample question: Design User Registration + File Upload Service (HLD) — System design: build a service supporting user registration and file-upload operations, authenticating users and enforcing role-based permissions across operation types. Lay out high-level components (load balancer, web/app tiers, object storage, DB), then dive into caching strategy and consistency-vs-availability trade-offs for the upload/metadata path.

  4. Round 3: Hiring Manager Round

    Behavioral · 45 minutes · difficulty 3/5

    Mode of interview: Live behavioral interview

Other companies' interview processes

Worked sample solutions (code, design diagrams, and STAR answers) for every round are available in the FAANGPlus app: open interview processes.