Flipkart
Indian e-commerce giant tackling massive supply chain and scale problems.
4 Rounds
~18 Days
Hard
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
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
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
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
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
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
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
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
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
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
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
Difficulty Radar
Based on recent AI-sourced data.
Meet Your Interviewers
The "Standard" Interviewer
Senior EngineerFocuses on core competencies, system constraints, and clear communication.
SimulateUnwritten Rules
Think Out Loud
Always explain your thought process before writing code or drawing architecture.