Pregunta de entrevista de Harness
maximum sub sequence problem finding min in a stack while keeping all the trial operations time complexity O(1)
Respuesta de la entrevista
Anónimo
10 may 2019
answered 1st one correctly with code 2nd I could not come u with O(1) solution