There’s no built-in Deque container, but there are several implementations available.
Here’s a good one from Stephen Cleary. This provides O(1) operations to index and also to insert at the beginning and append at the end.
The C# equivalent to Vector is List<T>. Indexed access is O(1), but insertion or removal is O(N) (other than Inserting at the end, which is O(1)).