Pergunta de entrevista da empresa Microsoft
Maximum Subarray (LeetCode question)
Resposta da entrevista
Sigiloso
6 de jun. de 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).