Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Agreed. This is a terrible source.

For example, the rotate array is much better handles with a deque; you get amortized constant time rotations.



Right, Deque is also another option, which has the same amortized time complexity and but extra O(n) space is required for Queue. In the given solution, O(n) time complexity and O(1) space is used




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: