Loading…
Explore questions associated with Flipkart. Review the source details, then use the workspace for code, notes, and diagrams.
10 questions in the library. A source association does not guarantee a future interview question.
Coding · System design
Loading questions…
Practice system design interviews out loud with an AI interviewer, a shared whiteboard and a scorecard for your level.
© 2026 SysRound. SysRound is an AI practice tool. The AI interviewer and the AI feedback can be wrong. Use it for your own practice, not to hire people.
Showing 1–10
Given an array of daily stock prices, compute the maximum profit achievable from exactly one buy-before-sell transaction (i.e., the largest prices[j] - prices[i] with j…
Companies: Flipkart, Adobe, Amazon, Apple +10
Array · Dynamic Programming
Find the minimum-cost route from src to dst in a directed weighted graph with the constraint of at most k stops (i.e., a bound on…
Companies: Flipkart, Illumio, Meta, Oracle +1
Breadth-First Search · Depth-First Search · Dynamic Programming · Graph Theory
Simulate days on an m×n grid where infected cells spread 4-directionally: each day identify all connected infected regions, compute for each the set of uninfected…
Companies: Flipkart, Uber
Array · Breadth-First Search · Depth-First Search · Matrix
Given heights of vertical lines at unit-spaced x-coordinates, pick two indices i<j to maximize the area min(height[i],height[j])*(j-i). With n up to 1e5, the problem requires…
Companies: Flipkart, Amazon, Bloomberg, Cisco +4
Array · Greedy · Two Pointers
Versioned documents: concurrent saves, durable history, global caching, and safe page-tree changes.
Companies: Flipkart, Amazon, Google, Notion
access-control · content-delivery · hierarchical-data · optimistic-concurrency
Given an array where nums[i] is the maximum forward jump from index i, compute the minimum number of jumps needed to reach the last index…
Companies: Flipkart, Amazon, Salesforce
Array · Dynamic Programming · Greedy
Given an acyclic directed graph of richer->poorer relations and a quietness score per person, compute for each person the quietest person among all people who…
Companies: Flipkart
Array · Depth-First Search · Directed Acyclic Graph · Graph Theory
Find the minimum day such that you can form at least m bouquets, each requiring k adjacent flowers that have bloomed (return -1 if impossible…
Companies: Flipkart, Amazon, Apple, Meta
Array · Binary Search
Given nums1 as a subset of nums2, for each element in nums1 return the first greater element that appears to its right in nums2 (or…
Companies: Flipkart, Microsoft
Array · Hash Table · Monotonic Stack · Stack
Given an m×n grid with empty cells, fresh (1) and rotten (2) oranges, compute the minimum minutes until all fresh oranges become rotten as rot…
Companies: Flipkart, Amazon, Anduril, Goldman Sachs +3
Array · Breadth-First Search · Matrix