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

Flipkart Placement Papers 2024

Overview

This page collects Flipkart 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 Flipkart patterns and the latest shifts.

Flipkart Online Assessment 2024 pattern

Section Questions Time Difficulty
Coding Problems 2-3 60 min Medium-Hard
Debugging 1 30 min Medium

Flipkart Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Flipkart 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: 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 2: 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 3: 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 4: 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 5: 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 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: 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 8

Q8: 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

Question 9

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

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

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: Worst-case time complexity of quicksort is?

Solution:

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

Answer: O(n²)

Hiring volume

  • Total Hires: 300+ freshers
  • SDE-1: 270+ selections
  • Focus Areas: DSA, System Design, E-commerce domain knowledge

Salary packages

  • SDE-1: ₹22-28 LPA
  • Base Salary: ₹18-22 LPA
  • Stock Options: Included in package

Question trends

  • Most Common: Array/String manipulation, Two pointers
  • Medium-Hard: Dynamic Programming, Tree/Graph problems
  • System Design: E-commerce features (cart, checkout, inventory)

Key insights from 2024 Flipkart Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. Coding Focus: Strong emphasis on array, string, and tree problems
  3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
  4. Debugging Section: Always included - practice debugging skills thoroughly
  5. System Design: Asked for SDE-2 roles, basic for SDE-1 roles
  6. E-commerce Focus: Problems often relate to e-commerce scenarios (cart, checkout, inventory)
  7. Success Rate: Only 10-15% cleared OA and advanced to interviews
  8. Platform: HackerRank or Flipkart’s internal platform

Flipkart 2024 interview experiences

Based on candidate experiences from 2024 Flipkart interviews:

2024 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems + 1 debugging question
  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: E-commerce systems for SDE-2+ roles
  • Behavioral round: Problem-solving approach, teamwork, impact

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, two pointers
  • System Design: E-commerce systems (cart, checkout, inventory, recommendation engine)
  • Debugging: Code fixes, logic errors, performance issues
  • Behavioral: Problem-solving examples, teamwork, impact on business metrics

2024 Interview Questions Examples:

  • Maximum Subarray Sum (Kadane’s Algorithm)
  • Two Sum Problem
  • Longest Substring Without Repeating Characters
  • Design Flipkart’s shopping cart system (System Design)
  • Design Flipkart’s recommendation engine (System Design)

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Practice debugging skills - this section is always included
  • Learn e-commerce system design - cart, checkout, inventory, recommendations
  • Prepare examples demonstrating problem-solving and business impact
  • Practice explaining your thought process clearly
  • Focus on time management - 2-3 problems in 90 minutes

For detailed interview experiences, visit Flipkart Interview Experience page.

Preparation tips for Flipkart 2024 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, strings, trees, graphs
  2. Practice Previous Year Papers: Solve Flipkart OA papers from 2020-2024 to understand patterns
  3. Time Management: Practice completing 2-3 coding problems in 60 minutes, debugging in 30 minutes
  4. Debugging Practice: Practice debugging code - identify and fix logic errors, performance issues
  5. System Design Basics: Learn e-commerce system design - cart, checkout, inventory for SDE-1+
  6. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees (medium-hard difficulty)
  7. E-commerce Focus: Practice problems related to e-commerce scenarios
  8. Mock Tests: Take timed practice tests to improve speed and accuracy
  9. Two Pointers Technique: Master two pointers - very common in Flipkart problems
  10. Dynamic Programming: Practice DP problems - frequently asked

Comments & Suggestions

Similar companies

Amazon · Zomato · Swiggy · Paytm · Phonepe · Meesho