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