Question d’entretien chez Microsoft
Maximum Subarray (LeetCode question)
Réponse à la question d'entretien
Utilisateur anonyme
6 juin 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).