These are Algorithms questions of the kind Flipkart actually asks — the patterns reported from Flipkart's AI-engineering rounds, where design trade-offs, scale and failure modes matter as much as definitions. Treat this page as a mock interview: say every answer out loud before revealing it. If one surprises you, the lesson behind it is linked at the bottom.
Flipkart Algorithms concept questions
Job sequencing: jobs with deadlines and profits, each taking 1 unit of time, one job at a time. Maximise profit. Which greedy, and why does it work?
Asked in
Minimum jumps to reach the end: arr[i] = max jump from i, e.g. [2, 3, 1, 1, 4]. The O(n²) DP is easy — what's the O(n) greedy, and why is it correct?
Asked in
Flipkart Algorithms applied & hands-on questions
Stalls at positions [1, 2, 4, 8, 9]; place 3 cows so the MINIMUM distance between any two is as large as possible. Classic binary-search-on-answer — solve it fully.
Asked in
How to use this page: Flipkart rarely asks something you've never seen — they ask a standard Algorithms concept and then push one level deeper ("why?", "what would you do if..."). Master the concept in the Algorithms course lessons, and the follow-up stops being scary.
Keep practising: Binary Search, Dynamic Programming, BFS & DFS and Patterns & Strategy cover what most Flipkart Algorithms rounds test.