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

Flipkart Placement Papers 2025

Overview

This page is a working set of Flipkart placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Flipkart 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 Flipkart drive.

Flipkart Online Assessment 2025 pattern

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

Flipkart Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Flipkart 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: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

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

Question 2: 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 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: 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: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

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

Question 6: 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 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: 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 normal form removes transitive dependency?

Solution:

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

Answer: 3NF

Expected hiring

  • Total Hires: 350+ freshers
  • SDE-1: 315+ selections
  • Focus: Advanced DSA, System Design, E-commerce domain

Salary packages

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

Question trends

  • Most Common: Dynamic Programming, Graph problems
  • Medium-Hard: Design problems (LRU Cache, etc.)
  • System Design: Scalability, E-commerce features

Key insights from 2025 Flipkart 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 - e-commerce systems
  5. E-commerce Context: Questions often relate to Flipkart’s domain (cart, checkout, inventory)
  6. Time Management: 2-3 problems in 90 minutes requires excellent speed
  7. Debugging: Always included - practice debugging skills thoroughly
  8. Success Rate: Only 10-15% cleared OA and advanced to interviews

Flipkart 2025 interview experiences

Based on recent candidate experiences from 2025 Flipkart interviews:

2025 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-1+ roles
  • Behavioral round: Problem-solving approach, teamwork, impact

2025 Interview Trends:

  • Increased emphasis on e-commerce 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 scalability and performance optimization

Common 2025 Interview Topics:

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

2025 Interview Questions Examples:

  • Product of Array Except Self
  • Design Flipkart’s shopping cart system (System Design)
  • Design Flipkart’s recommendation engine (System Design)
  • Design Flipkart’s search system (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 from 2025, visit Flipkart Interview Experience page.

Preparation tips for Flipkart 2025 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, strings, trees, graphs, DP
  2. Practice Previous Year Papers: Solve Flipkart OA papers from 2020-2025 to understand evolving 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 Mastery: Learn e-commerce system design - cart, checkout, inventory, recommendations 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
  11. Optimization Focus: Emphasize optimal solutions with better time/space complexity

Comments & Suggestions

2024 papers

Coding questions

Interview experience

Preparation guide

Flipkart hub

Similar companies

Amazon · Zomato · Swiggy · Paytm · Phonepe · Meesho