LeetCode
Question
#689 Maximum Sum of 3 Non-Overlapping Subarrays
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.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a generalmotors interview for a swe role during the coding round.
It covers the following topics: Prefix Sum, Arrays, Dynamic Programming, Sliding Window .
Difficulty rating: Hard