Swiggy Placement Papers 2024

Overview

This page collects Swiggy placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Swiggy patterns and the latest shifts.

2024 Pattern

The 2024 Swiggy placement process emphasized DSA mastery and food delivery system design. Online assessment included 2-3 DSA problems and debugging questions. Practice these Swiggy placement papers 2024 to understand the actual difficulty level and question patterns.

Swiggy Online Assessment 2024 exam pattern

Section	Questions	Time	Difficulty	Focus Areas
Coding Problem 1	1	30 min	Medium	Arrays, strings
Coding Problem 2	1	30 min	Hard	Trees, graphs, DP
Debugging	1	30 min	Medium	Code fixes

Total: 3 problems, 90 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 2024 - actual questions & solutions

This section contains practice questions styled on Swiggy placement papers 2024 (previous-year 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: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

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

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: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

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

Question 4: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

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

Question 5: 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 6: 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 7: 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 8

Q8: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Question 9

Q9: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Question 10

Q10: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Question 11

Q11: Which SQL clause filters grouped rows after GROUP BY?

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

2024 hiring trends

Hiring volume

• Total Hires: 150+ freshers
• SDE-1: 135+ selections
• Growth: 12% from 2023
• Locations: Bengaluru, Hyderabad

Salary packages

• SDE-1: ₹16-22 LPA
• SDE-2: ₹24-30 LPA
• 8% increase from 2023

Question difficulty

• Medium: 60% of questions
• Hard: 40% of questions
• Focus: DSA and system design

Key insights from 2024 Swiggy Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. DSA Focus: Strong emphasis on arrays, trees, graphs, and dynamic programming
3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
4. System Design: Asked for SDE-1/2 roles, food delivery domain knowledge helpful
5. Optimal Solutions: Required - focus on time and space complexity
6. Food Delivery Focus: Problems often relate to food delivery scenarios (matching, routing, logistics)
7. Success Rate: Only 10-15% cleared OA and advanced to interviews
8. Platform: HackerRank or Swiggy’s internal platform

Swiggy 2024 interview experiences

Based on candidate experiences from 2024 Swiggy interviews:

2024 Interview Process:

1. Online Assessment (90 minutes): 2-3 coding problems
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

Common 2024 Interview Topics:

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

2024 Interview Questions Examples:

• Array and string manipulation problems
• Tree and graph problems
• 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 minutes
• Understand logistics and matching algorithms

For detailed interview experiences, visit Swiggy Interview Experience page.

Preparation tips for Swiggy 2024 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-2024 to understand patterns
3. Time Management: Practice completing 2-3 coding problems in 90 minutes
4. System Design Basics: 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

Comments & Suggestions

Related resources

2025 papers→

Coding questions→

Interview experience→

Preparation guide→

Swiggy hub→

Zomato Placement Papers→

Similar companies

Zomato · Paytm · Flipkart · Phonepe · Meesho · Blinkit