Flipkart Placement Papers 2024 - Previous Year Questions & Solutions

Company Overview

This page contains Flipkart placement papers from 2024 with previous year questions, solutions, and exam patterns.

2024 Pattern

The 2024 Flipkart placement process emphasized DSA mastery and e-commerce system design. Online assessment included 2-3 DSA problems and debugging questions.

Flipkart Online Assessment 2024 Pattern

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

Actual 2024 Flipkart Coding Questions & Solutions

This section contains real coding questions from Flipkart placement papers 2024 based on candidate experiences from GeeksforGeeks, LeetCode, and interview forums.

DSA Coding Problems (2024)

Q1: Maximum Subarray Sum (Kadane’s Algorithm) - 2024 Real Question

Problem: Given an array of integers, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6
Explanation: [4, -1, 2, 1] has the largest sum = 6

Solution (Java):

public int maxSubArray(int[] nums) {
    int maxSoFar = nums[0];
    int maxEndingHere = nums[0];

    for (int i = 1; i < nums.length; i++) {
        maxEndingHere = Math.max(nums[i], maxEndingHere + nums[i]);
        maxSoFar = Math.max(maxSoFar, maxEndingHere);
    }

    return maxSoFar;
}

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

Q2: Two Sum Problem - 2024 Real Question

Problem: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]
Explanation: Because nums[0] + nums[1] == 9, we return [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 complement = target - nums[i];
        if (map.containsKey(complement)) {
            return new int[]{map.get(complement), i};
        }
        map.put(nums[i], i);
    }

    return new int[]{};
}

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

Q3: Longest Substring Without Repeating Characters - 2024 Real Question

Problem: Given a string s, find the length of the longest substring without repeating characters.

Example:

Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3

Solution (Java):

public int lengthOfLongestSubstring(String s) {
    Map<Character, Integer> map = new HashMap<>();
    int maxLen = 0;
    int start = 0;

    for (int end = 0; end < s.length(); end++) {
        char ch = s.charAt(end);
        if (map.containsKey(ch) && map.get(ch) >= start) {
            start = map.get(ch) + 1;
        }
        map.put(ch, end);
        maxLen = Math.max(maxLen, end - start + 1);
    }

    return maxLen;
}

Time Complexity: O(n), Space Complexity: O(min(n, m)) where m is charset size

Q4: Merge Two Sorted Lists - 2024 Real Question

Problem: Merge two sorted linked lists and return it as a sorted list.

Example:

Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]

Solution (Java):

public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
    ListNode dummy = new ListNode(0);
    ListNode current = dummy;

    while (list1 != null && list2 != null) {
        if (list1.val <= list2.val) {
            current.next = list1;
            list1 = list1.next;
        } else {
            current.next = list2;
            list2 = list2.next;
        }
        current = current.next;
    }

    current.next = (list1 != null) ? list1 : list2;
    return dummy.next;
}

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

Q5: Valid Parentheses - 2024 Real Question

Problem: Given a string s containing just the characters ’(’, ’)’, ', ', ’[’ and ’]’, determine if the input string is valid.

Example:

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

Solution (Java):

public boolean isValid(String s) {
    Stack<Character> stack = new Stack<>();

    for (char c : s.toCharArray()) {
        if (c == '(' || c == '{' || c == '[') {
            stack.push(c);
        } else {
            if (stack.isEmpty()) return false;
            char top = stack.pop();
            if ((c == ')' && top != '(') ||
                (c == '}' && top != '{') ||
                (c == ']' && top != '[')) {
                return false;
            }
        }
    }

    return stack.isEmpty();
}

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

Q6: Binary Tree Level Order Traversal - 2024 Real Question

Problem: Given the root of a binary tree, return the level order traversal of its nodes’ values.

Example:

Input: root = [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>> result = new ArrayList<>();
    if (root == null) return result;

    Queue<TreeNode> queue = new LinkedList<>();
    queue.offer(root);

    while (!queue.isEmpty()) {
        int levelSize = queue.size();
        List<Integer> currentLevel = new ArrayList<>();

        for (int i = 0; i < levelSize; i++) {
            TreeNode node = queue.poll();
            currentLevel.add(node.val);

            if (node.left != null) queue.offer(node.left);
            if (node.right != null) queue.offer(node.right);
        }

        result.add(currentLevel);
    }

    return result;
}

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

Debugging Questions (2024)

Q7: Debug Array Rotation - 2024 Real Question

Problem: Debug the following code that rotates an array to the right by k positions.

Buggy Code:

public void rotate(int[] nums, int k) {
    k = k % nums.length;
    for (int i = 0; i < k; i++) {
        int temp = nums[nums.length - 1];
        for (int j = nums.length - 1; j > 0; j--) {
            nums[j] = nums[j - 1];
        }
        nums[0] = temp;
    }
}

Issues Found:

1. The code works but is inefficient (O(n*k))
2. Better approach: Reverse entire array, then reverse first k and last n-k elements

Optimized Solution:

public void rotate(int[] nums, int k) {
    k = k % nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}

private void reverse(int[] nums, int start, int end) {
    while (start < end) {
        int temp = nums[start];
        nums[start] = nums[end];
        nums[end] = temp;
        start++;
        end--;
    }
}

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

2024 Hiring Trends

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

Related Resources

• Flipkart Placement Papers 2025 - Current year papers
• Flipkart Placement Papers Main Page - Complete guide
• Flipkart Online Assessment Guide - Detailed assessment pattern

---

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

Practice 2024 papers to understand Flipkart’s pattern and prepare effectively!