Pregunta de entrevista de Microsoft
Find max sum subsequence.
Respuesta de la entrevista
Anónimo
30 abr 2017
I suggest the dynamic programming solution. But the men ask for more slow and naive solution. So i proposed two solutions one n^3 and one n^2 and implemeted both