Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Swiggy Placement Papers 2025

Overview

This page is a working set of Swiggy placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Swiggy actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Swiggy drive.

Swiggy Online Assessment 2025 pattern

Section Questions Time Difficulty Focus Areas
Coding Problems 2-3 60-80 min Medium-Hard Arrays, trees, graphs, DP
Debugging 1-2 20-30 min Medium Code fixes, logic errors

Total: 3-5 problems, 90-120 minutes
Platform: HackerRank or Swiggy’s internal platform
Languages Allowed: Java, C++, Python, Go
Success Rate: ~10-15% cleared OA and advanced to interviews

Swiggy Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Swiggy placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

Time Complexity: O(S)
Space Complexity: O(1)

Question 2: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 3: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 4: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
Space Complexity: O(1)

Question 5: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 6: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 7: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 8

Q8: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 9

Q9: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 10

Q10: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 11

Q11: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Expected hiring

  • Total Hires: 180+ freshers
  • SDE-1: 162+ selections
  • SDE-2: 18+ selections
  • Locations: Bengaluru, Hyderabad, hybrid/remote

Salary packages

  • SDE-1: ₹16-22 LPA
  • SDE-2: ₹24-30 LPA
  • Senior SDE: ₹40-55 LPA

Question trends

  • Medium: 50% of questions
  • Hard: 50% of questions
  • Focus: Optimal solutions required

Key insights from 2025 Swiggy Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. Advanced Topics: More focus on DP, Graphs, and Design problems
  3. Optimization: Emphasis on optimal solutions (time/space complexity)
  4. System Design: More detailed for SDE-1 roles - food delivery systems
  5. Food Delivery Context: Questions often relate to Swiggy’s food delivery domain
  6. Company Values: Strong focus on behavioral assessment
  7. Time Management: 2-3 problems in 90-120 minutes requires excellent speed
  8. Debugging: Always included - practice debugging skills thoroughly
  9. Success Rate: Only 10-15% cleared OA and advanced to interviews

Swiggy 2025 interview experiences

Based on recent candidate experiences from 2025 Swiggy interviews:

2025 Interview Process:

  1. Online Assessment (90-120 minutes): 2-3 coding problems + 1-2 debugging questions
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions
  3. Onsite Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design round: Food delivery systems for SDE-1+ roles
  • Behavioral round: Problem-solving approach, teamwork, impact

2025 Interview Trends:

  • Increased emphasis on food delivery system design even for SDE-1 roles
  • More focus on optimal solutions with better complexity analysis
  • Enhanced behavioral questions about company values and impact
  • Questions about logistics optimization and real-time systems

Common 2025 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming
  • System Design: Food delivery systems (order matching, delivery partner allocation, real-time tracking)
  • Debugging: Code fixes, logic errors, performance issues
  • Behavioral: Problem-solving examples, teamwork, impact on business metrics
  • Food Delivery Knowledge: Order matching algorithms, logistics optimization, real-time systems

2025 Interview Questions Examples:

  • Minimum Window Substring
  • Design Swiggy’s order matching system (System Design)
  • Design Swiggy’s delivery partner allocation system (System Design)
  • Real-time tracking system design

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Learn food delivery system design - order matching, logistics, real-time tracking
  • Prepare examples demonstrating problem-solving and business impact
  • Practice explaining your thought process clearly
  • Focus on time management - 2-3 problems in 90-120 minutes
  • Understand logistics and matching algorithms in detail

For detailed interview experiences from 2025, visit Swiggy Interview Experience page.

Preparation tips for Swiggy 2025 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. Practice Previous Year Papers: Solve Swiggy OA papers from 2020-2025 to understand evolving patterns
  3. Time Management: Practice completing 2-3 coding problems in 60-80 minutes, debugging in 20-30 minutes
  4. System Design Mastery: Learn food delivery system design - order matching, logistics for SDE-1+
  5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
  6. Food Delivery Focus: Practice problems related to food delivery scenarios
  7. Mock Tests: Take timed practice tests to improve speed and accuracy
  8. Graph Algorithms: Master graph algorithms - matching, routing, optimization
  9. Dynamic Programming: Practice DP problems - frequently asked
  10. Logistics Knowledge: Understand logistics and matching algorithms for food delivery in detail
  11. Optimization Focus: Emphasize optimal solutions with better time/space complexity

Comments & Suggestions

2024 papers

Coding questions

Interview experience

Preparation guide

Swiggy hub

Zomato Placement Papers

Similar companies

Zomato · Paytm · Flipkart · Phonepe · Meesho · Blinkit