Domanda di colloquio di Microsoft
Maximum Subarray (LeetCode question)
Risposta di colloquio
Anonimo
6 giu 2019
Solved it in O(1) space and O(n) time but asked me to improve it further using DP which would only have degraded space complexity to O(n).