A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.
By chatting or signing in you agree to the Terms and chat-message logging (revocable in History).