Frage im Vorstellungsgespräch bei Microsoft
Maximum Subarray (LeetCode question)
Antwort im Vorstellungsgespräch
Anonym
6. Juni 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).