Flipkart is one of India’s leading e-commerce companies, known for its innovation in online retail, technology-driven logistics, and large-scale digital solutions. Founded in 2007 by Sachin and Binny Bansal, Flipkart is now part of the Walmart group and employs thousands of engineers across India.
Flipkart CGPA criteria (candidate-reported, based on campus drive data) commonly requires a minimum CGPA of 6.5 (65%) across all academic levels. Here’s the detailed breakdown:
| Academic Level | Commonly Required (Campus Drives) | Typical Selected Candidate |
|---|---|---|
| 10th Standard | 65% (6.5 CGPA) | 75%+ |
| 12th Standard | 65% (6.5 CGPA) | 75%+ |
| Graduation (B.Tech/B.E.) | 65% (6.5 CGPA) | 7.5-8.4 CGPA (average selected range) |
Flipkart CGPA Criteria
10th Standard: 65% or 6.5 CGPA minimum
12th Standard: 65% or 6.5 CGPA minimum
Graduation: 65% or 6.5 CGPA minimum (aggregate)
Important: You must meet the minimum CGPA requirement in ALL three levels (10th, 12th, and graduation) to be eligible for Flipkart placement.
CGPA for Better Selection Chances
6.5-7.4 CGPA: Meets minimum requirement, eligible to apply
7.5-8.4 CGPA: Good chances of selection (average selected candidate range)
8.5+ CGPA: Excellent chances, may be considered for premium roles and higher packages
Academic Requirements
Minimum Percentage: 65% or 6.5+ CGPA in 10th, 12th, and graduation
Degree: B.E./B.Tech/M.E./M.Tech/MCA in Computer Science, IT, ECE, EE, or related fields
Year of Study: Final year students and recent graduates (within 1 year)
Backlogs: No active backlogs at the time of selection
Branch Eligibility
Eligible Branches: CS, IT, ECE, EE, and related engineering streams
Programming Focus: Strong skills in Data Structures, Algorithms, and System Design
Experience: Freshers and up to 2 years experience (for entry-level SDE roles)
Additional Criteria
Coding Skills: Proficiency in at least one language (Java, C++, Python, Go)
Gap Years: Maximum 1 year gap allowed
Course Type: Full-time degrees only
Nationality: Indian citizens (for India roles)
Download free Flipkart placement papers 2025 with previous year questions, detailed solutions, exam pattern, and complete preparation guide. Access Flipkart last 5 years placement papers with solutions PDF download and practice with solved questions covering all sections.
2024 Placement Papers PDF
Download Flipkart placement papers 2024 PDF with previous year online assessment questions, solutions, and exam pattern analysis.
2025 Placement Papers PDF
Download latest Flipkart placement papers 2025 PDF with current year online assessment questions, solutions, and updated exam patterns.
2026 Preparation Guide
Prepare for Flipkart placement 2026 with expected online assessment pattern, question types, and comprehensive preparation strategy.
Online Assessment Guide
Complete guide to Flipkart online assessment (OA) format, DSA problems, coding questions, and preparation strategy.
Campus Recruitment
College Visits - Through placement cells at top engineering colleges
Direct registration via college coordinators
Off-Campus Drives
Flipkart Careers Portal - Apply online for Software Engineer and other roles
Participate in Flipkart GRiD, hackathons, and coding contests
Online Assessment
Direct Apply - flipkartcareers.com
Register with academic details and resume
Online Coding Assessment (OA) - 90-120 minutes
Format: Conducted on platforms like HackerRank or Flipkart’s internal tool
Success Rate: ~10-15% advance to interviews
Technical Interviews (2-3 rounds, 45-60 min each)
Format: Virtual or onsite
Managerial/Team Fit Interview (1 round, 45 min)
Format: Senior engineer or manager
HR/Offer Discussion (20-30 min)
Format: HR Manager
| Phase | Duration | Key Activities |
|---|---|---|
| Online Assessment | 1 day | Coding, debugging |
| Technical Interviews | 1-2 weeks | DSA, system design |
| Managerial/Team Fit | 2-3 days | Flipkart values, teamwork |
| HR Discussion | Same day | Offer, negotiation |
| Result Declaration | 2-3 days | Offer letter, background check |
Flipkart OA questions are administered in the first round of the placement process and focus heavily on Data Structures & Algorithms. The OA is conducted on HackerRank or Flipkart’s internal platform and typically includes:
Complete Flipkart OA Questions Guide
Access the complete Flipkart online assessment guide including:
Q1: Maximum Sum Subarray (Kadane’s Algorithm)
Problem: Find the contiguous subarray within a one-dimensional array of numbers that has the largest sum.
Solution:
def max_subarray_sum(arr): max_sum = float('-inf') current_sum = 0 for num in arr: current_sum += num if current_sum > max_sum: max_sum = current_sum if current_sum < 0: current_sum = 0 return max_sumExplanation: Use Kadane’s algorithm - keep track of current sum and reset to 0 if it becomes negative. Time: O(n), Space: O(1).
Answer: Returns the maximum sum of any contiguous subarray.
Q2: Two Sum Problem
Problem: Find two distinct indices such that nums[i] + nums[j] = target.
Solution:
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[]{};}Explanation: Use hash map to store number and index. For each number, check if complement exists. Time: O(n), Space: O(n).
Answer: Returns indices of two numbers that sum to target.
Q3: Reverse Linked List
Problem: Given the head of a singly linked list, reverse the list and return the new head.
Solution:
public ListNode reverseList(ListNode head) { ListNode prev = null; ListNode current = head; while (current != null) { ListNode next = current.next; current.next = prev; prev = current; current = next; } return prev;}Explanation: Iterate through list, reversing pointers. Time: O(n), Space: O(1).
Answer: Returns the head of reversed linked list.
Q4: Binary Tree Level Order Traversal
Problem: Return values level by level from left to right.
Solution:
def levelOrder(root): if not root: return [] result = [] queue = [root] while queue: level = [] size = len(queue) for _ in range(size): node = queue.pop(0) level.append(node.val) if node.left: queue.append(node.left) if node.right: queue.append(node.right) result.append(level) return resultExplanation: Use BFS with queue to traverse level by level. Time: O(n), Space: O(n).
Answer: Returns list of lists containing values at each level.
Q5: Longest Palindromic Substring
Problem: Given a string s, return the longest palindromic substring.
Solution:
public String longestPalindrome(String s) { int n = s.length(); boolean[][] dp = new boolean[n][n]; String result = "";
for (int i = n - 1; i >= 0; i--) { for (int j = i; j < n; j++) { dp[i][j] = s.charAt(i) == s.charAt(j) && (j - i < 3 || dp[i + 1][j - 1]); if (dp[i][j] && j - i + 1 > result.length()) { result = s.substring(i, j + 1); } } } return result;}Explanation: Use dynamic programming - dp[i][j] is true if substring from i to j is palindrome. Time: O(n²), Space: O(n²).
Answer: Returns the longest palindromic substring.
Graph Traversal
This problem is a classic example of finding the shortest path in a graph using algorithms like Dijkstra’s or Breadth-First Search (BFS). The problem statement typically involves a graph represented by an adjacency matrix or list, and two nodes (source and destination). The goal is to find the minimum number of edges or the minimum sum of weights from the source to the destination.
Example:
// Assuming a graph is represented as an adjacency matrix// int[][] graph = {{0, 1, 2}, {1, 0, 1}, {2, 1, 0}};// int source = 0;// int destination = 2;
// BFS approachQueue<Integer> queue = new LinkedList<>();boolean[] visited = new boolean[graph.length];queue.add(source);visited[source] = true;int distance = 0;
while (!queue.isEmpty()) { int size = queue.size(); for (int i = 0; i < size; i++) { int current = queue.poll(); if (current == destination) { return distance; } for (int neighbor = 0; neighbor < graph.length; neighbor++) { if (graph[current][neighbor] != 0 && !visited[neighbor]) { queue.add(neighbor); visited[neighbor] = true; } } } distance++;}return -1; // No path foundDynamic Programming
This problem is a classic example of Dynamic Programming (DP) used for solving the “Coin Change” problem. The goal is to find the minimum number of coins needed to make a given amount using a set of coin denominations. The DP approach involves building a table where each entry dp[i] represents the minimum number of coins needed to make amount i.
Example:
int coinChange(int[] coins, int amount) { int[] dp = new int[amount + 1]; Arrays.fill(dp, amount + 1); // Initialize with a value larger than any possible answer dp[0] = 0; // Base case: 0 coins needed to make amount 0
for (int i = 1; i <= amount; i++) { for (int coin : coins) { if (coin <= i) { dp[i] = Math.min(dp[i], dp[i - coin] + 1); } } } return dp[amount] > amount ? -1 : dp[amount]; // If amount cannot be made, return -1}Design an Order Management System
Design a Product Recommendation Engine
Customer Focus
Ownership
DSA Fundamentals
Arrays & Strings: Manipulation, searching, sorting
Trees & Graphs: Traversals, shortest path, DFS/BFS
Dynamic Programming: Memoization, tabulation
Hashing: Hash maps, sets
System Design Basics
E-commerce Architecture: Order management, inventory, payments
Database Design: SQL vs NoSQL, normalization
API Design: RESTful APIs, authentication
Scalability: Load balancing, caching, sharding
Learn from real Flipkart placement interview experiences shared by candidates who successfully cleared the placement process. These authentic stories help you understand what to expect, how Flipkart evaluates candidates, and how to prepare effectively.
Key Insights from Interview Experiences:
Complete Interview Experiences
Read detailed Flipkart placement interview experiences including:
Technical Interview Experience 1
Candidate Profile: Final year CS student from tier-1 college, 8.5 CGPA, strong DSA background
Key Takeaways: Strong DSA preparation is essential. System design knowledge helped in round 3. Behavioral preparation using STAR format was crucial. Communication and problem-solving approach matter as much as correct solutions.
Technical Interview Experience 2
Candidate Profile: 2 years experience, tier-2 college, strong system design background
Key Takeaways: System design experience was valuable. Previous work experience helped in team fit round. Clear communication about projects and challenges is important.
HR Interview Experience
Candidate Profile: Final year student, cleared all technical rounds
Key Takeaways: Research about Flipkart’s culture and values. Be honest about salary expectations. Show enthusiasm and cultural fit. Prepare questions to ask the interviewer.
Prepare for Flipkart placement HR interview with common questions and effective strategies. Flipkart HR interview focuses on cultural fit, motivation, and alignment with company values.
Common HR Interview Topics:
Complete HR Interview Guide
Access complete guide to Flipkart HR interview questions including:
“Tell me about yourself”
“Describe a time you worked in a team”
“Why Flipkart?”
“Are you willing to relocate?”
DSA Mastery
Priority: Critical
Time Allocation: 50%
System Design & OOP
Priority: High
Time Allocation: 20%
Flipkart Values
Priority: High
Time Allocation: 20%
Aptitude & Communication
Priority: Medium
Time Allocation: 10%
| Level | Experience | Base Salary | Total Package | Typical Background |
|---|---|---|---|---|
| SDE-1 | New Grad | ₹18-22 LPA | ₹22-28 LPA | Fresh graduates, top colleges |
| SDE-2 | 2-4 years | ₹28-35 LPA | ₹35-45 LPA | 2-4 years experience |
| Senior SDE | 5-8 years | ₹45-60 LPA | ₹60-80 LPA | Senior developers |
| Lead Engineer | 8+ years | ₹80+ LPA | ₹1 Cr+ | Architects, tech leads |
| Role | Level | Total Package | Requirements |
|---|---|---|---|
| QA Engineer | Entry-Mid | ₹10-18 LPA | Testing, automation |
| Product Manager | Mid-Senior | ₹30-60 LPA | Product sense, tech background |
| Data Scientist | Mid | ₹25-40 LPA | ML, analytics |
| DevOps Engineer | Entry-Mid | ₹15-30 LPA | Cloud, automation |
Hiring Trends 2025
Increased Virtual Hiring: More online assessments and interviews
System Design Emphasis: More focus in interviews
Diversity Hiring: Special drives for women and underrepresented groups
Process Changes
Online Assessments: More debugging and scenario-based questions
Team Fit Round: Mandatory for all SDE hires
Faster Offers: Reduced time from interview to offer
New Initiatives
Flipkart GRiD: Coding competition for hiring
Student Programs: Internships, Flipkart Runway
Internal Referrals: Employee referral program
Company Growth
Product Expansion: More engineering and data roles in India
Product Innovation: E-commerce, logistics, fintech
Global Mobility: Opportunities to work abroad
Ready to start your Flipkart preparation? Focus on DSA, system design, and Flipkart company values. Practice mock interviews and build strong STAR stories.
Pro Tip: Consistent practice on LeetCode and HackerRank is key. Understand Flipkart’s values and be ready to demonstrate them in behavioral rounds.
Flipkart placement papers are previous year question papers from Flipkart recruitment tests and interview rounds. These papers help students understand the exam pattern and prepare effectively.
Yes, all Flipkart placement papers on our website are completely free to access and download. You can practice unlimited questions without any registration or payment.
We provide Flipkart placement papers from recent years including 2024 and 2025. Our collection is regularly updated with the latest questions and exam patterns.
Flipkart placement process includes: 1. Online Coding Assessment (90-120 minutes) - 2-3 DSA problems (Flipkart OA questions) and debugging, 2. Technical Interviews (2-3 rounds, 45-60 min each) - DSA, coding, and system design for SDE-1/2, 3. Managerial/Team Fit Interview (45 min) - Flipkart values and scenario-based questions, 4. HR/Offer Discussion (20-30 min) - personal background and compensation. Total duration: 2-4 weeks from application to offer.
Flipkart OA (online assessment) questions consist of 2-3 DSA coding problems covering arrays, strings, trees, graphs, and dynamic programming (medium to hard difficulty), plus debugging questions where you find and fix bugs in provided code. The OA runs for 90-120 minutes on HackerRank or Flipkart’s internal platform, supports Java, C++, Python, and Go, and has an advancement rate of approximately 10-15%. See the complete Flipkart OA questions guide for topic-wise practice problems.
Flipkart interview process typically consists of 2-3 rounds: online test, technical interview, and HR interview. Some roles may have additional rounds.
Flipkart eligibility criteria for freshers (candidate-reported, based on campus drive data): commonly required minimum of 65% or 6.5+ CGPA in 10th, 12th, and graduation. Degree required: B.E./B.Tech/M.E./M.Tech/MCA in Computer Science, IT, ECE, EE, or related fields. Final year students and recent graduates (within 1 year) are eligible. No active backlogs at the time of selection, maximum 1 year gap allowed, and strong skills in Data Structures, Algorithms, and System Design. Requirements can vary by drive, so verify with your placement cell or Flipkart’s careers page.
The minimum CGPA required for Flipkart is commonly reported as 6.5 CGPA (65%) across 10th, 12th, and graduation, based on recent campus placement drives. Flipkart does not publish one universal official CGPA cutoff for every drive. Candidates with 7.5-8.4 CGPA represent the average selected candidate range, while 8.5+ CGPA offers excellent chances, especially combined with strong DSA and system design skills.
Yes, 7.0 CGPA (70%) comfortably clears the commonly reported 6.5 CGPA baseline for Flipkart and puts you close to the 7.5-8.4 CGPA range typical of selected candidates. However, Flipkart places heavy weight on DSA problem-solving and system design performance in the OA and technical interviews — strong coding skills matter more than CGPA alone once you clear the minimum threshold.
To prepare for Flipkart placement: 1. Understand eligibility criteria, 2. Study exam pattern, 3. Practice previous year papers, 4. Master key skills, 5. Prepare for interviews. See the preparation strategy section for detailed guidance.
Focus on aptitude, reasoning, coding, and core computer science subjects. See the preparation strategy section for detailed topic breakdown.
Flipkart offers excellent opportunities including: competitive compensation (₹22-28 LPA for freshers), cutting-edge e-commerce tech work, fast-paced startup culture, comprehensive benefits, and strong career growth. Flipkart’s culture emphasizes customer focus, innovation, and ownership.
Flipkart primarily hires CS, IT, ECE, and EE students with strong programming skills. However, candidates from other branches with exceptional coding skills and relevant projects may also be considered.
Flipkart has offices in Bengaluru and other major cities. Relocation depends on the role and team. Many roles now offer hybrid/remote options.
Flipkart: Best for e-commerce tech, Indian market focus, and scale. Salary: ₹22-28 LPA for freshers. Amazon: Global exposure, leadership principles. Salary: ₹28-42 LPA. Myntra: Fashion e-commerce, design focus. Salary: ₹18-25 LPA. All are excellent choices in e-commerce.
Explore related Flipkart placement paper topics and preparation guides:
Flipkart 2024 Papers
Previous year papers with OA questions and solutions
Flipkart 2025 Papers
Latest papers with current year OA questions
Flipkart 2026 Guide
Expected patterns and preparation guide for 2026
Flipkart Coding Questions
Complete collection of Flipkart coding problems with solutions
Flipkart Interview Experience
Real interview experiences from successful candidates
Flipkart HR Interview Questions
Common HR questions and sample answers
Flipkart Preparation Guide
Comprehensive preparation strategy for Flipkart OA
Flipkart Online Assessment
Detailed guide to Flipkart online assessment format
Amazon Placement Papers
E-commerce company, similar DSA and system design focus
Zomato Placement Papers
Indian product company, food tech, system design focus
Swiggy Placement Papers
Food delivery, system design and scalability focus
Last updated: August 2026