Explain Kadane algorithm for maximum subarray sum — Flipkart interview
Reported in Flipkart interview loops. Frequent array optimization question testing dynamic programming intuition.
Interview atlas
Explore 100 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered Flipkart ×
Reported in Flipkart interview loops. Frequent array optimization question testing dynamic programming intuition.
Reported in Flipkart interview loops. Array prefix-suffix pattern often asked in coding rounds.
Reported in Flipkart interview loops. Classic linked list pointer question in entry and mid-level interviews.
Reported in Flipkart interview loops. Hash set based linear-time approach for sequence detection.
Reported in Flipkart interview loops. Heap and selection strategy question with multiple valid approaches.
Reported in Flipkart interview loops. Advanced string window question seen in strong coding interviews.
Reported in Flipkart interview loops. Graph traversal question using DFS or BFS flood-fill.
Reported in Flipkart interview loops. Topological sort and directed cycle detection interview staple.
Reported in Flipkart interview loops. Dynamic programming optimization with unbounded choices.
Reported in Flipkart interview loops. Simple but important recurrence-based DP interview problem.
Reported in Flipkart interview loops. Data structure trade-off question for autocomplete and dictionary lookups.
Reported in Flipkart interview loops. Hard interview classic requiring binary search partition logic.
Reported in Flipkart interview loops. Disjoint set union structure used in graph connectivity interviews.
Reported in Flipkart interview loops. Pattern recognition question for linear-time array scans.
Reported in Flipkart interview loops. System design problem testing reliability, fan-out, and channel abstraction.