Flipkart Online Assessment

Overview

Flipkart OA questions and Flipkart OA pattern (from student reports) are covered here: format, rounds after the OA, sample DSA/debugging problems with solutions, and how to prepare. The Flipkart online assessment is the first round for most SDE campus and off-campus drives.

OA Success Rate

Flipkart online assessment has a success rate of approximately 10-15%, meaning only top performers advance to interviews. Focus on solving problems optimally with all test cases passing.

Flipkart OA rounds

Stage	What candidates report	Goal
1. Flipkart OA	90-120 min, 2-3 DSA + debugging on HackerRank / internal platform	Clear all (or almost all) test cases with near-optimal complexity
2. Technical interviews	2-3 rounds: DSA, machine coding / PS-DS, projects	Explain trade-offs; write clean code
3. Hiring manager / culture	Ownership, e-commerce product sense	Flipkart values + past impact
4. HR	Role, location, offer discussion	Fit and logistics

Clearing Flipkart OA questions only shortlists you - interviews decide the offer. Pattern details below.

Flipkart Online Assessment format

Test structure

Component	Details	Time Allocation
Platform	HackerRank or Flipkart’s internal platform	-
Duration	90-120 minutes	Total time
DSA Problems	2-3 coding problems	60-80 minutes
Debugging	1-2 debugging questions	20-30 minutes
Languages	Java, C++, Python, Go	-
Evaluation	All test cases must pass	-

Key characteristics

• Problem-Solving Focus: Strong emphasis on DSA and algorithms
• Optimal Solutions: Time and space complexity matter
• Test Cases: All test cases must pass for qualification
• E-Commerce Domain: Questions may relate to e-commerce scenarios
• Time Pressure: Efficient problem-solving under time constraints

Flipkart Online Assessment question types

1. DSA problems

Flipkart online assessment questions primarily focus on Data Structures and Algorithms:

Arrays & strings

• Array manipulation and searching
• String processing and pattern matching
• Two-pointer technique
• Sliding window problems

Trees & graphs

• Binary tree traversals
• Tree construction and manipulation
• Graph algorithms (BFS, DFS)
• Shortest path problems

Dynamic programming

• Classic DP problems
• Optimization problems
• Memoization techniques

E-commerce related problems

• Order matching algorithms
• Inventory management
• Price optimization
• Recommendation systems

2. Debugging questions

Debugging questions in Flipkart OA test your ability to:

• Identify bugs in given code
• Fix logical errors
• Correct syntax issues
• Improve code efficiency

Sample Flipkart Online Assessment questions

Question 1: array problem

Q: Given an array of product prices, find the maximum profit from buying and selling (similar to stock problem).

Problem: Find the maximum profit from buying and selling products, where you can make at most one transaction.

Solution:

public int maxProfit(int[] prices) {
    if (prices.length == 0) return 0;

    int minPrice = prices[0];
    int maxProfit = 0;

    for (int i = 1; i < prices.length; i++) {
        if (prices[i] < minPrice) {
            minPrice = prices[i];
        } else {
            maxProfit = Math.max(maxProfit, prices[i] - minPrice);
        }
    }

    return maxProfit;
}

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

Question 2: tree problem

Q: Given a binary tree representing product categories, find the maximum depth.

Solution:

class TreeNode {
    int val;
    TreeNode left, right;
}

public int maxDepth(TreeNode root) {
    if (root == null) return 0;

    int leftDepth = maxDepth(root.left);
    int rightDepth = maxDepth(root.right);

    return 1 + Math.max(leftDepth, rightDepth);
}

Time Complexity: O(n) Space Complexity: O(h) where h is height

Question 3: graph / BFS

Q: Given a grid of warehouse zones (0 empty, 1 blocked), find the shortest path from start to destination moving 4-directionally.

Approach: BFS from the start cell; each move costs 1. Skip blocked cells and visited positions. First time you reach the destination is the shortest path length. O(R·C) time.

Why it shows up in Flipkart OA: logistics / warehouse routing flavours of grid shortest path are common medium DSA prompts.

Question 4: sliding window

Q: Given an array of order amounts and a window size k, find the maximum sum of any contiguous k orders.

Approach: Compute sum of first k elements, then slide: add arr[i], remove arr[i-k], track the max. O(n) time, O(1) extra space. Watch for negative amounts if the problem allows them.

Question 5: string / hash map

Q: Given two strings representing SKU codes, check if they are anagrams (same character multiset).

Approach: Count frequency of each character (array of size 26 or hash map); compare counts. O(n) time. Edge cases: different lengths → false immediately.

Question 6: debugging-style prompt

Q: A function that should return the second largest distinct price in an array sometimes returns the largest. Find and fix the bug.

Typical bug: updating second with first when seeing a duplicate of the max, or initializing second to Integer.MIN_VALUE incorrectly when all values are equal. Fix by tracking two distinct values and skipping equals of the current max.

OA tip: Flipkart OA may include short debugging snippets - read constraints and sample I/O before rewriting from scratch.

More Flipkart OA Practice

These Flipkart OA questions mirror from student reports medium/hard themes (arrays, trees, graphs, windows, strings, debugging). For more volume see Flipkart coding questions and the main Flipkart guide.

How to prepare for Flipkart Online Assessment

Step 1: master DSA fundamentals

Arrays & strings

Practice array manipulation, two-pointer technique, sliding window, and string processing problems. Solve 30+ problems.

Trees & graphs

Master tree traversals, tree construction, graph algorithms (BFS, DFS), and shortest path problems. Solve 25+ problems.

Dynamic programming

Practice classic DP problems, optimization problems, and memoization techniques. Solve 20+ DP problems.

Step 2: practice on coding platforms

• LeetCode: Solve medium and hard problems
• HackerRank: Practice on the same platform as Flipkart OA
• Codeforces: Improve problem-solving speed
• GeeksforGeeks: Review DSA concepts and problems

Step 3: solve Flipkart OA previous year questions

• Practice with Flipkart placement papers
• Understand question patterns and difficulty
• Focus on optimal solutions
• Time yourself while solving

Step 4: study e-commerce domain

• Understand order management systems
• Learn about inventory management
• Study recommendation algorithms
• Review Flipkart’s business model

Flipkart Online Assessment tips

Optimal Solutions Matter

Flipkart OA evaluates not just correctness but also optimality. Focus on time and space complexity. O(n^2) solutions may not pass all test cases even if correct.

General tips

1. Read Problems Carefully: Understand requirements and constraints
2. Plan Before Coding: Outline approach and algorithm
3. Handle Edge Cases: Consider empty arrays, single elements, etc.
4. Test Your Code: Verify with sample inputs before submitting
5. Optimize Solutions: Aim for optimal time/space complexity
6. Manage Time: Don’t spend too long on one problem

Related resources

• Flipkart Placement Papers Main Page - Complete guide with eligibility, process, and preparation
• Flipkart Interview Experience - Real interview experiences and tips
• Online Assessment Hub - Guide to all company online assessments

Similar companies

Amazon · Zomato · Swiggy · Paytm · Phonepe · Meesho

Share:WhatsAppFacebookEmail

---

Ready to prepare for Flipkart online assessment? Master DSA fundamentals, practice 100+ problems, and take mock assessments to improve your problem-solving skills and clear the OA.

Pro Tip: Practice solving 2-3 medium/hard DSA problems daily under time constraints. Focus on optimal solutions and ensure all test cases pass.