Performance

Use Vec for most cases, VecDeque for queues, and avoid LinkedList due to poor cache performance.

use std::collections::{VecDeque, LinkedList};

// Best for random access and iteration
let mut vec = Vec::new();
vec.push(1);

// Best for pushing/popping from both ends (queue/stack)
let mut deque = VecDeque::new();
deque.push_front(1);
deque.push_back(2);

// Avoid: slow iteration and high memory overhead
let mut list = LinkedList::new();
list.push_back(3);

Think of Vec as a dynamic array that stores items in a single block of memory, making it fast to read and iterate. VecDeque is a double-ended queue that allows adding or removing items from both the front and back efficiently. LinkedList connects items via pointers scattered in memory, which makes it slow to traverse and memory-heavy, so you should rarely use it.