Question Details
LeetCode #53: Maximum Subarray. Difficulty: Medium. Topics: Array, Divide and Conquer, Dynamic Programming. Asked at Yandex 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 yandex interview for a swe role during the coding round.
It covers the following topics: Divide And Conquer, Arrays, Dynamic Programming, Recursion .
Difficulty rating: Medium