Flipkart Placement Papers 2026 - Complete Preparation Guide

Last Updated: March 2026

📋 Company Overview

Attribute	Details
Company	Flipkart Internet Private Limited
Industry	E-commerce, Internet
Headquarters	Bangalore, Karnataka, India
Founded	2007 (by Sachin Bansal and Binny Bansal)
Parent Company	Walmart Inc. (acquired in 2018)
Employees	30,000+

Flipkart is India's leading e-commerce marketplace, offering over 150 million products across 80+ categories. Known for its innovation in the Indian e-commerce space, Flipkart pioneered concepts like Cash on Delivery (COD) and No Cost EMI in India. The company is now a subsidiary of Walmart and continues to be one of the most attractive employers for tech talent in India.

🎓 Eligibility Criteria (2026 Batch)

Criteria	Requirement
Degree	B.Tech/B.E., M.Tech, MCA, M.S. (Computer Science preferred)
Branches	CSE, IT, ECE, EEE
CGPA	7.0+ (or 70% and above)
Backlogs	No active backlogs
Year of Passing	2026
Experience	Freshers only

💰 CTC for Freshers 2026

Component	Amount (Approximate)
Base Salary	₹12-18 LPA
Joining Bonus	₹1-2 LPA
Stock Options (ESOPs)	₹2-4 LPA (vested over 4 years)
Relocation Allowance	₹50,000 - 1,00,000
Performance Bonus	Up to 10% of base
Total CTC (First Year)	₹15-25 LPA

Note: SDE-1 roles typically start at ₹15-18 LPA, while high-performing candidates may receive up to ₹25 LPA.

📝 Exam Pattern

Round	Duration	Format	Topics
Online Assessment	90 mins	3 coding problems	Data Structures, Algorithms
Technical Interview 1	60 mins	DSA + Problem Solving	Arrays, Trees, DP, Graphs
Technical Interview 2	60 mins	LLD/HLD + Coding	System Design, OOP
Hiring Manager	45 mins	Behavioral + Project Discussion	Culture fit, Leadership
HR Interview	30 mins	HR Discussion	Compensation, Joining

Detailed Pattern:

Online Assessment:

Platform: HackerRank / Codility / Custom
3 coding questions (Easy, Medium, Hard)
Focus: Arrays, Strings, Trees, Graphs, DP
Passing criteria: Solve 2+ questions optimally

🧮 Aptitude Questions (15 Questions with Solutions)

Question 1: Percentages

A number is increased by 20% and then decreased by 20%. What is the net percentage change?

Options:

(a) 0%
(b) 4% decrease
(c) 4% increase
(d) 2% decrease

Solution: Let original number = 100 After 20% increase: 100 × 1.20 = 120 After 20% decrease: 120 × 0.80 = 96

Net change = 96 - 100 = -4 Percentage change = (-4/100) × 100 = 4% decrease

Formula shortcut: Net % change = a + b + (ab/100) = 20 + (-20) + (20 × -20)/100 = 0 - 4 = -4%

Question 2: Mixtures and Alligations

A merchant has 100 kg of sugar, part of which he sells at 8% profit and the rest at 18% profit. He gains 14% on the whole. What quantity is sold at 18% profit?

Options:

(a) 40 kg
(b) 50 kg
(c) 60 kg
(d) 70 kg

Solution: Using Alligation method:

8%        18%
    \   /
     14%
    /   \
  4      6  (differences)

Ratio = 4:6 = 2:3

Quantity at 18% = (3/5) × 100 = 60 kg

Question 3: Time and Distance

A train running at 54 km/hr crosses a platform in 30 seconds. The length of the platform is 250m. What is the length of the train?

Options:

(a) 150m
(b) 200m
(c) 220m
(d) 250m

Solution: Speed = 54 km/hr = 54 × (5/18) = 15 m/s Distance covered = Speed × Time = 15 × 30 = 450m

Distance = Train length + Platform length 450 = Train length + 250 Train length = 200m

Question 4: Number Series

Find the next term: 3, 12, 27, 48, 75, ?

Options:

(a) 100
(b) 108
(c) 112
(d) 120

Solution: Pattern: 3×1², 3×2², 3×3², 3×4², 3×5², 3×6² = 3, 12, 27, 48, 75, 108

Or: Differences are 9, 15, 21, 27, 33 (increasing by 6) 75 + 33 = 108

Question 5: Profit and Loss

By selling 33 meters of cloth, a shopkeeper gains the selling price of 11 meters. What is the gain percentage?

Options:

(a) 40%
(b) 45%
(c) 50%
(d) 55%

Solution: Let SP of 1 meter = ₹1 SP of 33 meters = ₹33 Profit = SP of 11 meters = ₹11

CP = SP - Profit = 33 - 11 = ₹22

Gain % = (11/22) × 100 = 50%

Shortcut: Profit % = [Profit/(Total - Profit)] × 100 = [11/(33-11)] × 100 = (11/22) × 100 = 50%

Question 6: Work and Time

A can complete a work in 12 days. B is 60% more efficient than A. How many days will B take to complete the same work?

Options:

(a) 6 days
(b) 7.5 days
(c) 8 days
(d) 9 days

Solution: A's 1 day work = 1/12 B is 60% more efficient, so B's efficiency = 1.60 × A's efficiency

B's 1 day work = 1.60 × (1/12) = 16/120 = 2/15

Days for B = 15/2 = 7.5 days

Question 7: Simple Interest

A sum becomes 3 times itself in 20 years at simple interest. In how many years will it become 7 times itself?

Options:

(a) 50 years
(b) 60 years
(c) 70 years
(d) 80 years

Solution: Let P = principal, SI = simple interest Amount = P + SI = 3P So SI = 2P (in 20 years)

Rate R = (SI × 100)/(P × T) = (2P × 100)/(P × 20) = 10%

For amount to become 7P: SI needed = 6P Time = (SI × 100)/(P × R) = (6P × 100)/(P × 10) = 60 years

Question 8: Probability

Two dice are thrown. What is the probability that the sum is neither 7 nor 11?

Options:

(a) 7/9
(b) 5/9
(c) 2/3
(d) 1/2

Solution: Total outcomes = 36

Sum = 7: (1,6), (2,5), (3,4), (4,3), (5,2), (6,1) = 6 ways Sum = 11: (5,6), (6,5) = 2 ways

P(sum is 7 or 11) = 8/36 = 2/9 P(neither 7 nor 11) = 1 - 2/9 = 7/9

Question 9: Permutations

How many 4-letter words can be formed from the letters of the word 'LOGARITHM' without repetition?

Options:

(a) 2400
(b) 3024
(c) 3600
(d) 4200

Solution: Word 'LOGARITHM' has 9 distinct letters.

Number of 4-letter words = ⁹P₄ = 9!/(9-4)! = 9 × 8 × 7 × 6 = 3024

Question 10: Data Interpretation

Study the pie chart and answer:

Company expenditure breakdown:

Salaries: 35%
Infrastructure: 25%
Marketing: 20%
R&D: 15%
Others: 5%

If the total expenditure is ₹50 crores, what is the difference between expenditure on Salaries and R&D?

Options:

(a) ₹8 crores
(b) ₹10 crores
(c) ₹12 crores
(d) ₹15 crores

Solution: Difference in percentages = 35% - 15% = 20% Difference in amount = 20% of ₹50 crores = 0.20 × 50 = ₹10 crores

Question 11: Average Weight

The average weight of 8 persons increases by 2.5 kg when a new person comes in place of one of them weighing 65 kg. What is the weight of the new person?

Options:

(a) 75 kg
(b) 80 kg
(c) 85 kg
(d) 90 kg

Solution: Total weight increase = 8 × 2.5 = 20 kg

New person's weight = Old person's weight + Total increase = 65 + 20 = 85 kg

Question 12: Ratio

If A:B = 2:3, B:C = 4:5, and C:D = 6:7, then A:D = ?

Options:

(a) 8:35
(b) 16:35
(c) 12:35
(d) 24:35

Solution: A:B = 2:3 = 8:12 (multiplying by 4) B:C = 4:5 = 12:15 (multiplying by 3) So A:B:C = 8:12:15

C:D = 6:7 = 30:35 (to make C=30, multiply by 2) But C = 15 in previous ratio, so multiply A:B:C by 2: 16:24:30

A:B:C:D = 16:24:30:35 A:D = 16:35

Question 13: Boats and Streams

A boat can travel 30 km upstream in 5 hours. If the speed of the stream is 2 km/hr, how long will it take to cover 40 km downstream?

Options:

(a) 4 hours
(b) 5 hours
(c) 6 hours
(d) 8 hours

Solution: Upstream speed = 30/5 = 6 km/hr Let boat speed in still water = B, stream speed = S = 2 km/hr

Upstream: B - S = 6 B - 2 = 6 B = 8 km/hr

Downstream speed = B + S = 8 + 2 = 10 km/hr Time for 40 km downstream = 40/10 = 4 hours

Question 14: Logical Reasoning

Statement: All engineers are intelligent. Some intelligent people are creative. Conclusions: I. All creative people are engineers. II. Some engineers are creative.

Options:

(a) Only I follows
(b) Only II follows
(c) Both follow
(d) Neither follows

Solution: Analyzing with Venn diagrams:

Engineers circle inside Intelligent circle
Creative circle overlaps with Intelligent circle

Conclusion I: Cannot say all creative people are engineers (Creative extends beyond Engineers) Conclusion II: Engineers and Creative may or may not overlap - not definite

Question 15: Blood Relations

Pointing to a woman, Mr. X said, "Her only brother is the only son of my mother." How is Mr. X related to the woman?

Options:

(a) Father
(b) Brother
(c) Husband
(d) Son

Solution: "Only son of my mother" = Mr. X himself (assuming Mr. X is male) "Her only brother" = Mr. X

Therefore, the woman is Mr. X's sister.

But wait - if her only brother is Mr. X, then they are siblings.

💻 Technical/CS Questions (10 Questions with Solutions)

Question 1: Data Structures

What is the height of a balanced binary tree with n nodes?

Options:

(a) O(1)
(b) O(log n)
(c) O(n)
(d) O(√n)

Solution: In a balanced binary tree, each level approximately doubles the number of nodes. With height h, maximum nodes = 2^h - 1. For n nodes: n ≤ 2^h - 1, so h ≤ log₂(n+1) Therefore, height = O(log n)

Question 2: Algorithms

Which of the following is NOT a divide and conquer algorithm?

Options:

(a) Merge Sort
(b) Quick Sort
(c) Binary Search
(d) Bubble Sort

Solution:

Merge Sort: Divide array, sort halves, merge (Divide & Conquer)
Quick Sort: Pick pivot, partition, recurse (Divide & Conquer)
Binary Search: Divide search space in half (Divide & Conquer)
Bubble Sort: Compare adjacent elements repeatedly (Not D&C)

Question 3: Database

Which normal form eliminates transitive dependencies?

Options:

(a) First Normal Form (1NF)
(b) Second Normal Form (2NF)
(c) Third Normal Form (3NF)
(d) Boyce-Codd Normal Form (BCNF)

Solution:

1NF: Eliminates repeating groups, ensures atomic values
2NF: Eliminates partial dependencies (for composite keys)
3NF: Eliminates transitive dependencies (A → B → C)
BCNF: Stricter version of 3NF

Question 4: Operating Systems

What is thrashing in an operating system?

Options:

(a) Excessive CPU usage
(b) High rate of page faults causing low CPU utilization
(c) Memory leak in applications
(d) Disk fragmentation

Solution: Thrashing occurs when a system spends more time handling page faults (swapping pages in and out of memory) than executing applications. This happens when the working set exceeds available physical memory.

Question 5: Computer Networks

Which protocol is used for reliable data transfer?

Options:

(a) UDP
(b) TCP
(c) IP
(d) HTTP

Solution: TCP (Transmission Control Protocol) provides reliable, ordered, and error-checked delivery of data using acknowledgments, sequence numbers, and retransmissions.

Question 6: OOP

Which concept allows a subclass to provide a specific implementation of a method already defined in its parent class?

Options:

(a) Overloading
(b) Overriding
(c) Inheritance
(d) Encapsulation

Solution: Method overriding is when a subclass provides its own implementation of a method inherited from the parent class. This enables runtime polymorphism.

Question 7: Data Structures

What is the minimum number of stacks needed to implement a queue?

Options:

(a) 1
(b) 2
(c) 3
(d) 4

Solution: Two stacks are required: one for enqueue operations and one for dequeue operations. When dequeue is called and the output stack is empty, all elements from the input stack are transferred to the output stack, reversing the order to achieve FIFO behavior.

Question 8: Algorithms

What is the time complexity of heap sort in the worst case?

Options:

(a) O(n)
(b) O(n log n)
(c) O(n²)
(d) O(log n)

Solution: Heap sort always performs in O(n log n) time:

Building heap: O(n)
n extractions, each O(log n): O(n log n)
Total: O(n log n) in all cases

Question 9: DBMS

What is the purpose of an index in a database?

Options:

(a) To enforce data integrity
(b) To speed up data retrieval
(c) To reduce storage space
(d) To encrypt sensitive data

Solution: An index is a data structure (typically B-tree) that allows the database to find rows faster without scanning the entire table, similar to an index in a book.

Question 10: System Design

Which caching strategy updates the cache only when data is read?

Options:

(a) Write-through
(b) Write-back
(c) Cache-aside (Lazy loading)
(d) Write-around

Solution: Cache-aside (or lazy loading) only populates the cache when data is requested. The application first checks the cache; on a miss, it reads from the database and updates the cache.

📚 Verbal/English Questions (10 Questions with Solutions)

Question 1: Synonyms

Choose the word closest to "PRAGMATIC":

Options:

(a) Idealistic
(b) Practical
(c) Theoretical
(d) Imaginative

Solution: Pragmatic means dealing with things sensibly and realistically, based on practical considerations.

Question 2: Antonyms

Opposite of "ABUNDANT":

Options:

(a) Sufficient
(b) Plentiful
(c) Scarce
(d) Profuse

Solution: Abundant means existing in large quantities. Scarce means insufficient for demand, rare.

Question 3: Error Spotting

"The team of players were practicing for the final match."

Options:

(a) The team of players
(b) were practicing
(c) for the final match
(d) No error

Solution: "Team" is a collective noun and takes singular verb. Should be "was practicing" not "were practicing."

Question 4: Fill in Blanks

"Despite the heavy rain, the match ______ as scheduled."

Options:

(a) was cancelled
(b) continued
(c) was postponed
(d) delayed

Solution: "Despite" indicates contrast. If there was heavy rain, normally a match would be cancelled/postponed, but "despite" suggests it happened anyway - continued.

Question 5: Comprehension

"E-commerce has revolutionized retail by providing consumers with unprecedented convenience. However, concerns about data privacy and environmental impact of packaging remain significant challenges that the industry must address."

What is the author's tone?

Options:

(a) Entirely critical
(b) Entirely supportive
(c) Balanced/Objectively analytical
(d) Pessimistic

Solution: The author acknowledges benefits (convenience, revolution) while also noting challenges (privacy, environment). This shows balanced analysis.

Question 6: Analogy

"Paint" is to "Artist" as "Clay" is to:

Options:

(a) Potter
(b) Sculpture
(c) Art
(d) Mold

Solution: An artist uses paint to create art. A potter uses clay to create pottery.

Question 7: Idioms

"To burn the midnight oil" means:

Options:

(a) To waste time
(b) To work late into the night
(c) To be angry
(d) To be very tired

Solution: This idiom means to work or study late at night, often indicating hard work or dedication.

Question 8: Sentence Improvement

"She prefers tea than coffee."

Options:

(a) tea than coffee
(b) tea more than coffee
(c) tea to coffee
(d) No improvement

Solution: With "prefers," the correct preposition is "to," not "than."

Question 9: Word Substitution

A person who knows many languages:

Options:

(a) Polyglot
(b) Linguist
(c) Bilingual
(d) Multilingual

Solution:

Polyglot: Person who knows and uses several languages
Linguist: Expert in linguistics (study of language)
Bilingual: Knowing two languages
Multilingual: In multiple languages (adjective)

Question 10: Rearrangement

Arrange: P: In the modern era Q: E-commerce has transformed R: The way people shop S: By offering convenience

Options:

(a) PQRS
(b) QPRS
(c) PRQS
(d) PQSR

Solution: "In the modern era, e-commerce has transformed the way people shop by offering convenience."

🖥️ Coding Questions (5 Questions with Python Solutions)

Question 1: Find Duplicate in Array

Problem: Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number. Find it without modifying the array and using only constant extra space.

Example:

Input: nums = [1, 3, 4, 2, 2]
Output: 2

Python Solution (Floyd's Cycle Detection):

def find_duplicate(nums):
    """
    Floyd's Tortoise and Hare (Cycle Detection)
    Time: O(n), Space: O(1)
    """
    # Phase 1: Find intersection point
    slow = nums[0]
    fast = nums[0]
    
    while True:
        slow = nums[slow]           # Move 1 step
        fast = nums[nums[fast]]     # Move 2 steps
        if slow == fast:
            break
    
    # Phase 2: Find entrance to cycle
    slow = nums[0]  # Reset slow to start
    while slow != fast:
        slow = nums[slow]
        fast = nums[fast]
    
    return slow

# Alternative: Binary Search approach
def find_duplicate_binary_search(nums):
    """
    Time: O(n log n), Space: O(1)
    """
    low, high = 1, len(nums) - 1
    
    while low < high:
        mid = (low + high) // 2
        
        # Count numbers <= mid
        count = sum(1 for num in nums if num <= mid)
        
        if count > mid:
            high = mid  # Duplicate is in lower half
        else:
            low = mid + 1  # Duplicate is in upper half
    
    return low

# Test
print(find_duplicate([1, 3, 4, 2, 2]))      # 2
print(find_duplicate([3, 1, 3, 4, 2]))      # 3

Question 2: Product of Array Except Self

Problem: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. Must run in O(n) without using division.

Example:

Input: nums = [1, 2, 3, 4]
Output: [24, 12, 8, 6]

Python Solution:

def product_except_self(nums):
    """
    Time: O(n), Space: O(1) excluding output array
    """
    n = len(nums)
    answer = [1] * n
    
    # First pass: left products
    left_product = 1
    for i in range(n):
        answer[i] = left_product
        left_product *= nums[i]
    
    # Second pass: right products
    right_product = 1
    for i in range(n - 1, -1, -1):
        answer[i] *= right_product
        right_product *= nums[i]
    
    return answer

def product_except_self_with_prefix_suffix(nums):
    """
    More explicit approach
    Time: O(n), Space: O(n)
    """
    n = len(nums)
    prefix = [1] * n
    suffix = [1] * n
    
    # Build prefix products
    for i in range(1, n):
        prefix[i] = prefix[i-1] * nums[i-1]
    
    # Build suffix products
    for i in range(n-2, -1, -1):
        suffix[i] = suffix[i+1] * nums[i+1]
    
    # Combine
    return [prefix[i] * suffix[i] for i in range(n)]

# Test
print(product_except_self([1, 2, 3, 4]))    # [24, 12, 8, 6]
print(product_except_self([-1, 1, 0, -3, 3]))  # [0, 0, 9, 0, 0]

Question 3: Longest Substring Without Repeating Characters

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

Example:

Input: s = "abcabcbb"
Output: 3
Explanation: "abc" with length 3

Python Solution (Sliding Window):

def length_of_longest_substring(s):
    """
    Sliding Window with Hash Set
    Time: O(n), Space: O(min(m, n)) where m is charset size
    """
    char_set = set()
    left = 0
    max_length = 0
    
    for right in range(len(s)):
        # If duplicate found, shrink window from left
        while s[right] in char_set:
            char_set.remove(s[left])
            left += 1
        
        char_set.add(s[right])
        max_length = max(max_length, right - left + 1)
    
    return max_length

def length_of_longest_substring_optimized(s):
    """
    Optimized: Store last seen index
    Time: O(n), Space: O(m)
    """
    char_index = {}  # char -> last seen index
    max_length = 0
    left = 0
    
    for right, char in enumerate(s):
        # If char seen and is in current window
        if char in char_index and char_index[char] >= left:
            left = char_index[char] + 1
        
        char_index[char] = right
        max_length = max(max_length, right - left + 1)
    
    return max_length

# Test
print(length_of_longest_substring("abcabcbb"))   # 3
print(length_of_longest_substring("bbbbb"))      # 1
print(length_of_longest_substring("pwwkew"))     # 3
print(length_of_longest_substring_optimized("abcdef"))  # 6

Question 4: Kth Largest Element in Array

Problem: Find the kth largest element in an unsorted array. Note that it is the kth largest element in sorted order, not the kth distinct element.

Example:

Input: nums = [3, 2, 1, 5, 6, 4], k = 2
Output: 5

Python Solution (Multiple Approaches):

import heapq
import random

def find_kth_largest_sorting(nums, k):
    """
    Simple sorting approach
    Time: O(n log n), Space: O(1) or O(n)
    """
    nums.sort(reverse=True)
    return nums[k - 1]

def find_kth_largest_heap(nums, k):
    """
    Min Heap approach
    Time: O(n log k), Space: O(k)
    """
    # Maintain min heap of size k
    heap = []
    for num in nums:
        heapq.heappush(heap, num)
        if len(heap) > k:
            heapq.heappop(heap)
    
    return heap[0]  # Root is kth largest

def find_kth_largest_quickselect(nums, k):
    """
    QuickSelect (Hoare's selection algorithm)
    Average Time: O(n), Worst: O(n²)
    Space: O(1)
    """
    def partition(left, right, pivot_idx):
        pivot = nums[pivot_idx]
        # Move pivot to end
        nums[pivot_idx], nums[right] = nums[right], nums[pivot_idx]
        
        store_idx = left
        for i in range(left, right):
            if nums[i] < pivot:
                nums[store_idx], nums[i] = nums[i], nums[store_idx]
                store_idx += 1
        
        # Move pivot to final place
        nums[right], nums[store_idx] = nums[store_idx], nums[right]
        return store_idx
    
    def select(left, right, k_smallest):
        """Returns kth smallest element"""
        if left == right:
            return nums[left]
        
        # Random pivot
        pivot_idx = random.randint(left, right)
        pivot_idx = partition(left, right, pivot_idx)
        
        if k_smallest == pivot_idx:
            return nums[k_smallest]
        elif k_smallest < pivot_idx:
            return select(left, pivot_idx - 1, k_smallest)
        else:
            return select(pivot_idx + 1, right, k_smallest)
    
    # kth largest = (n - k)th smallest
    return select(0, len(nums) - 1, len(nums) - k)

# Test
nums = [3, 2, 1, 5, 6, 4]
k = 2
print(find_kth_largest_heap(nums, k))        # 5
print(find_kth_largest_quickselect(nums, k)) # 5

Question 5: Course Schedule (Topological Sort)

Problem: There are a total of numCourses courses labeled from 0 to numCourses-1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. Return true if you can finish all courses.

Example:

Input: numCourses = 2, prerequisites = [[1, 0]]
Output: true
Explanation: Take course 0, then course 1

Python Solution (Kahn's Algorithm):

from collections import defaultdict, deque

def can_finish_bfs(num_courses, prerequisites):
    """
    Kahn's Algorithm (BFS Topological Sort)
    Time: O(V + E), Space: O(V + E)
    """
    # Build adjacency list and calculate in-degrees
    graph = defaultdict(list)
    in_degree = [0] * num_courses
    
    for course, prereq in prerequisites:
        graph[prereq].append(course)
        in_degree[course] += 1
    
    # Start with courses having no prerequisites
    queue = deque()
    for i in range(num_courses):
        if in_degree[i] == 0:
            queue.append(i)
    
    courses_taken = 0
    
    while queue:
        course = queue.popleft()
        courses_taken += 1
        
        for next_course in graph[course]:
            in_degree[next_course] -= 1
            if in_degree[next_course] == 0:
                queue.append(next_course)
    
    # If we can take all courses, no cycle exists
    return courses_taken == num_courses

def can_finish_dfs(num_courses, prerequisites):
    """
    DFS with cycle detection
    Time: O(V + E), Space: O(V + E)
    """
    graph = defaultdict(list)
    for course, prereq in prerequisites:
        graph[course].append(prereq)
    
    # 0 = unvisited, 1 = visiting, 2 = visited
    state = [0] * num_courses
    
    def has_cycle(course):
        if state[course] == 1:  # Currently visiting - cycle detected
            return True
        if state[course] == 2:  # Already visited
            return False
        
        state[course] = 1  # Mark as visiting
        for prereq in graph[course]:
            if has_cycle(prereq):
                return True
        state[course] = 2  # Mark as visited
        return False
    
    for course in range(num_courses):
        if has_cycle(course):
            return False
    
    return True

# Test
print(can_finish_bfs(2, [[1, 0]]))           # True
print(can_finish_bfs(2, [[1, 0], [0, 1]]))   # False (cycle)
print(can_finish_dfs(4, [[1, 0], [2, 1], [3, 2]]))  # True
print(can_finish_dfs(4, [[1, 0], [0, 1], [2, 3]]))  # False

💡 Interview Tips

1. Focus on E-commerce Domain Knowledge

Flipkart is an e-commerce giant. Understanding concepts like inventory management, recommendation systems, payment gateways, and distributed systems at scale will give you an edge. Be prepared to design systems like an e-commerce platform or recommendation engine.

2. Master Competitive Programming

Flipkart's online assessment is competitive programming-focused. Practice on LeetCode, HackerRank, and CodeChef. Aim to solve 2-3 problems in the OA to clear the cutoff.

3. Prepare for System Design (LLD + HLD)

For experienced roles or exceptional freshers, expect Low-Level Design (LLD) questions involving class diagrams, OOP principles, and High-Level Design (HLD) questions about distributed systems. Study design patterns and scalability concepts.

4. Understand Walmart's Culture

Since Flipkart is owned by Walmart, understanding Walmart's values - customer obsession, respect for individuals, striving for excellence, and acting with integrity - will help in behavioral rounds.

5. Know Your Projects Deeply

Be ready to discuss your projects in detail. Know the architecture, your specific contributions, challenges faced, and how you solved them. Use the STAR method for structured responses.

6. Practice Mock Interviews

Flipkart interviews can be intense. Practice coding aloud with a timer. Get comfortable explaining your thought process clearly and handling follow-up questions about time/space complexity optimizations.

7. Brush Up on CS Fundamentals

Don't neglect DBMS, OS, CN, and OOP concepts. Flipkart's tech stack involves Java, Spring Boot, microservices, and cloud technologies. Basic understanding of these helps.

❓ Frequently Asked Questions

Q1: What is the package offered by Flipkart for freshers in 2026?

A: Flipkart offers a CTC of approximately ₹15-25 LPA for Software Development Engineer (SDE-1) roles. The package typically includes base salary (₹12-18 LPA), joining bonus, ESOPs vesting over 4 years, and relocation assistance.

Q2: Does Flipkart hire only from tier-1 colleges?

A: While Flipkart does extensive campus hiring from IITs, NITs, BITS, and other premier institutions, they also consider off-campus applications and referrals. Strong coding skills and relevant projects can help candidates from any college get shortlisted.

Q3: What is Flipkart's interview difficulty level compared to Amazon?

A: Flipkart interviews are generally considered similarly challenging to Amazon. Both focus heavily on data structures, algorithms, and problem-solving. Flipkart may have more emphasis on e-commerce domain problems and competitive programming in the OA.

Q4: How important is knowledge of distributed systems for Flipkart interviews?

A: For entry-level SDE roles, DSA is the primary focus. However, for internships converting to PPOs or higher-level roles, knowledge of distributed systems, microservices, and scalable architecture is highly beneficial and often tested.

Q5: What technologies should I know for Flipkart?

A: Flipkart primarily uses Java, Python, and Go for backend services. Familiarity with Spring Boot, microservices architecture, MySQL/PostgreSQL, Redis, Kafka, and cloud platforms (AWS/GCP) is advantageous. For frontend, React and JavaScript are commonly used.

📖 Additional Resources

LeetCode: Focus on Medium/Hard problems, especially Array, String, Tree, and Graph questions
System Design Primer (GitHub): For HLD preparation
Head First Design Patterns: For LLD and OOP concepts
Flipkart Tech Blog: Read about their architecture and engineering challenges
GeeksforGeeks Flipkart Interview Experiences

All the best for your Flipkart interview preparation! 🚀

Remember: Flipkart values innovation and customer obsession. Show them you're passionate about building products that impact millions of Indians.

Flipkart Placement Papers 2026

Flipkart Placement Papers 2026 - Complete Preparation Guide

📋 Company Overview

🎓 Eligibility Criteria (2026 Batch)

💰 CTC for Freshers 2026

📝 Exam Pattern

Detailed Pattern:

🧮 Aptitude Questions (15 Questions with Solutions)

Question 1: Percentages

Question 2: Mixtures and Alligations

Question 3: Time and Distance

Question 4: Number Series

Question 5: Profit and Loss

Question 6: Work and Time

Question 7: Simple Interest

Question 8: Probability

Question 9: Permutations

Question 10: Data Interpretation

Question 11: Average Weight

Question 12: Ratio

Question 13: Boats and Streams

Question 14: Logical Reasoning

Question 15: Blood Relations

💻 Technical/CS Questions (10 Questions with Solutions)

Question 1: Data Structures

Question 2: Algorithms

Question 3: Database

Question 4: Operating Systems

Question 5: Computer Networks

Question 6: OOP

Question 7: Data Structures

Question 8: Algorithms

Question 9: DBMS

Question 10: System Design

📚 Verbal/English Questions (10 Questions with Solutions)

Question 1: Synonyms

Question 2: Antonyms

Question 3: Error Spotting

Question 4: Fill in Blanks

Question 5: Comprehension

Question 6: Analogy

Question 7: Idioms

Question 8: Sentence Improvement

Question 9: Word Substitution

Question 10: Rearrangement

🖥️ Coding Questions (5 Questions with Python Solutions)

Question 1: Find Duplicate in Array

Question 2: Product of Array Except Self

Question 3: Longest Substring Without Repeating Characters

Question 4: Kth Largest Element in Array

Question 5: Course Schedule (Topological Sort)

💡 Interview Tips

1. Focus on E-commerce Domain Knowledge

2. Master Competitive Programming

3. Prepare for System Design (LLD + HLD)

4. Understand Walmart's Culture

5. Know Your Projects Deeply

6. Practice Mock Interviews

7. Brush Up on CS Fundamentals

❓ Frequently Asked Questions

Q1: What is the package offered by Flipkart for freshers in 2026?

Q2: Does Flipkart hire only from tier-1 colleges?

Q3: What is Flipkart's interview difficulty level compared to Amazon?

Q4: How important is knowledge of distributed systems for Flipkart interviews?

Q5: What technologies should I know for Flipkart?

📖 Additional Resources

Share this article: