Question d’entretien chez Yelp
Implement maximum subarray sum.
Réponse à la question d'entretien
Utilisateur anonyme
16 nov. 2018
I said we can go through each interval O(n^2) and then optimized to O(n log n) by being suggested divide and conquer approach and then optimized to O(n) by using dynamic programming.