Frage im Vorstellungsgespräch bei Harness
maximum sub sequence problem finding min in a stack while keeping all the trial operations time complexity O(1)
Antwort im Vorstellungsgespräch
Anonym
10. Mai 2019
answered 1st one correctly with code 2nd I could not come u with O(1) solution