Generalmotors

1 questions · 2 experiences · LeetCode (2) · 1p3a (1)

Read our Generalmotors interview guide

3 entries

#689 Maximum Sum of 3 Non-Overlapping Subarrays

LeetCode SWE

Question

#689 Maximum Sum of 3 Non-Overlapping Subarrays

#1404 Number of Steps to Reduce a Number in Binary Representation to One

LeetCode SWE

Experience

#1404 Number of Steps to Reduce a Number in Binary Representation to One

Generalmotors AI PhD Interview Experience and Cautionary Advice

1p3a MLE

Feb 2026 Experience

Generalmotors AI PhD Interview Experience and Cautionary Advice

Feb 2026 Experience

LeetCode Question

#689 Maximum Sum of 3 Non-Overlapping Subarrays

SWE coding Hard

Sign in to bookmark Original →

Question Details

LeetCode #689: Maximum Sum of 3 Non-Overlapping Subarrays. Difficulty: Hard. Topics: Array, Dynamic Programming, Sliding Window, Prefix Sum. Asked at General Motors in the last 6 months.

Free preview. Unlock all questions →

Topics

Array Dynamic Programming Sliding Window Prefix Sum

More from Generalmotors

1p3a Generalmotors AI PhD Interview Experience and Cautionary Advice LeetCode #1404 Number of Steps to Reduce a Number in Binary Representation to One

View full page →