Microsoft interview question
Maximum Subarray (LeetCode question)
Interview Answer
Anonymous
6 Jun 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).
Maximum Subarray (LeetCode question)
Anonymous
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).
Check out your Company Bowl for anonymous work chats.