Hacker News new | ask | show | jobs
by bpicolo 4624 days ago
Worst part is their max-stack isn't optimal. You can do it with O(1) additional space.
2 comments

Please explain. Without maintaining that ordering, you're going to have to iterate over the entire stack after every pop, no? One of their requirements was to keep pop() at O(1) rather than O(n).
Hm. How?