Flipkart

Flipkart

Indian e-commerce giant tackling massive supply chain and scale problems.

4 Rounds ~18 Days Hard
Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

Backend Engineer • Coding • medium

Given a grid representing a warehouse where 0 is empty, 1 is fresh produce, and 2 is rotten produce. Every minute, rotten produce infects adjacent fresh produce. Find the minimum time to rot all produce.

#Breadth-First Search #Graphs #Matrix
Practice
Backend Engineer • Coding • medium

Design a data structure that supports adding a product to a cart, removing a product, and getting the most recently added product in O(1) time. (LRU Cache variant)

#Linked List #Hash Map #Design
Practice
Backend Engineer • Coding • hard

Trapping Rain Water: Given an array representing the heights of stacked inventory boxes, compute how much water can be trapped between them after a roof leak.

#Two Pointers #Dynamic Programming #Stack
Practice
Backend Engineer • Coding • hard

Given two sorted arrays of user ratings for a product, find the median rating in O(log(m+n)) time.

#Binary Search #Divide and Conquer #Arrays
Practice
Backend Engineer • Coding • hard

Find the shortest path for a delivery drone in a 2D grid with obstacles. The drone can eliminate at most 'k' obstacles.

#Breadth-First Search #Matrix #State Space Search
Practice
Backend Engineer • Coding • medium

Find the longest increasing subsequence of prices for a stock over a given period.

#Dynamic Programming #Binary Search
Practice
Backend Engineer • Coding • hard

Merge K sorted lists of product IDs returned from different regional databases into a single sorted list.

#Linked List #Divide and Conquer #Heap
Practice
Backend Engineer • Coding • medium

Find the top K most frequently purchased items in a stream of order logs.

#Heap #Hash Map #Bucket Sort
Practice
Backend Engineer • Coding • hard

Given a string representing a search query without spaces and a dictionary of valid products, add spaces to construct all possible valid product combinations. (Word Break II)

#Backtracking #Dynamic Programming #Trie
Practice
Backend Engineer • Coding • medium

Given arrival and departure times of delivery trucks at a Flipkart fulfillment center, find the minimum number of loading bays required so that no truck is kept waiting.

#Sorting #Greedy #Arrays
Practice
Cloud Engineer • Coding • hard

Given a list of server logs with timestamps and error codes, write a function to find the longest contiguous window where the error rate exceeded 5%.

#Sliding Window #Data Structures #Log Parsing
Practice
DevOps Engineer • Coding • hard

Given a list of dependency pairs (Service A depends on Service B), write a function to output a valid deployment order.

#Graphs #Topological Sort #Python
Practice
Frontend Engineer • Coding • easy

Given an array of product objects with categories, write a function to group them by category and sort the categories alphabetically.

#Array Methods #Sorting #Object Manipulation
Practice
Frontend Engineer • Coding • medium

Implement an LRU (Least Recently Used) Cache in JavaScript.

#Data Structures #Map #Linked List
Practice
Frontend Engineer • Coding • medium

Find the Lowest Common Ancestor (LCA) of two given nodes in a DOM tree.

#DOM #Tree Traversal #Pointers
Practice
Full Stack Engineer • Coding • hard

Given a sorted dictionary of an alien language having N words and k starting alphabets of standard dictionary. Find the order of characters in the alien language.

#Graphs #Topological Sort #String
Practice
Full Stack Engineer • Coding • medium

Given a grid where each cell can have a 0 (empty), 1 (fresh orange), or 2 (rotten orange), every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1.

#Graphs #BFS #Matrix
Practice
Full Stack Engineer • Coding • hard

Design and implement a data structure for Least Recently Used (LRU) cache. It should support get and put operations in O(1) average time complexity.

#Design #Linked List #Hash Map
Practice
Full Stack Engineer • Coding • medium

Given an array representing the arrival and departure times of trains at a station, find the minimum number of platforms required so that no train is kept waiting.

#Greedy #Sorting #Arrays
Practice
Full Stack Engineer • Coding • hard

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

#Two Pointers #Dynamic Programming #Stack
Practice
Full Stack Engineer • Coding • hard

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order.

#Dynamic Programming #Backtracking #Trie
Practice
Full Stack Engineer • Coding • medium

Find the first non-repeating character in a stream of characters. You need to design a class with an insert(char c) method and a getFirstNonRepeating() method.

#Queue #Hash Map #Doubly Linked List
Practice
Full Stack Engineer • Coding • hard

You are given an array of k linked-lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.

#Heap #Divide and Conquer #Linked List
Practice
Full Stack Engineer • Coding • medium

Given a circular integer array nums of length n, return the next greater element for every element in nums. The next greater element of a number x is the first greater number to its traversing-order next in the array.

#Stack #Monotonic Stack #Arrays
Practice
Full Stack Engineer • Coding • medium

There is an integer array nums sorted in ascending order (with distinct values) that is possibly rotated at an unknown pivot index. Given an integer target, return its index if it is in nums, or -1 if it is not in nums. You must write an algorithm with O(log n) runtime complexity.

#Binary Search #Arrays
Practice
Machine Learning Engineer • Coding • medium

Given a dictionary of valid words and a search query string with no spaces, write a function to determine if the string can be segmented into a space-separated sequence of valid words.

#Dynamic Programming #Strings #Trie
Practice
Machine Learning Engineer • Coding • easy

Given an array of integers, return the indices of the two numbers such that they add up to a specific target.

#Arrays #Hash Map
Practice
Machine Learning Engineer • Coding • medium

Given a binary tree representing a hierarchical product category structure, write a function to find the lowest common ancestor of two given category nodes.

#Trees #Recursion #Depth-First Search
Practice
Machine Learning Engineer • Coding • easy

Given an array of integers representing product prices, find the maximum profit you can achieve by buying and selling once.

#Arrays #Greedy
Practice
Machine Learning Engineer • Coding • medium

Write a function to find the longest palindromic substring in a given search query string.

#Strings #Dynamic Programming #Expand Around Center
Practice
Machine Learning Engineer • Coding • medium

Given a list of delivery time intervals for a specific pin code, merge all overlapping intervals.

#Arrays #Sorting
Practice
Machine Learning Engineer • Coding • medium

Given an array of strings representing search queries, write a function to group all anagrams together. This helps in query normalization.

#Strings #Hash Map #Sorting
Practice
Machine Learning Engineer • Coding • medium

Implement an LRU Cache. This is often used to cache product details for fast retrieval during high-traffic events.

#Data Structures #Hash Map #Doubly Linked List
Practice
Machine Learning Engineer • Coding • hard

Given a map of delivery locations represented as a weighted graph, write an algorithm to find the shortest delivery route for an Ekart executive that visits all nodes and returns to the hub.

#Graphs #Traveling Salesperson #Dynamic Programming
Practice
Software Engineer • Coding • hard

Given a sorted dictionary of an alien language having N words and k starting alphabets of standard dictionary. Find the order of characters in the alien language.

#Graph #Topological Sort #String
Practice
Software Engineer • Coding • medium

Implement an LRU (Least Recently Used) Cache. It should support get and put operations in O(1) time complexity.

#Hash Map #Doubly Linked List
Practice
Software Engineer • Coding • hard

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

#Binary Search #Array #Divide and Conquer
Practice
Software Engineer • Coding • medium

Given an integer array nums, return the length of the longest strictly increasing subsequence.

#Dynamic Programming #Binary Search
Practice
Software Engineer • Coding • medium

There are a total of numCourses courses you have to take. Some courses have prerequisites. Determine if it is possible for you to finish all courses.

#Graph #Topological Sort #DFS
Practice
Software Engineer • Coding • hard

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

#Linked List #Heap #Divide and Conquer
Practice
Software Engineer • Coding • hard

Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord.

#Graph #Breadth-First Search #String
Practice
Software Engineer • Coding • hard

Given two strings s and t, return the minimum window in s which will contain all the characters in t. If there is no such window, return an empty string.

#Sliding Window #Hash Table #String
Practice
Software Engineer • Coding • hard

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

#Two Pointers #Dynamic Programming #Array
Practice
Software Engineer • Coding • medium

Given a grid where each cell can have a 0 (empty), 1 (fresh orange), or 2 (rotten orange), find the minimum time required to rot all oranges. A rotten orange rots adjacent fresh ones every minute.

#Graph #Breadth-First Search
Practice

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now