Beginner
Open lesson
Stack
Push onto the top, peek without removing, and pop the last value added.
DATA STRUCTURES & ALGORITHMS
Follow operations on organized collections of values.
Push onto the top, peek without removing, and pop the last value added.
Enqueue at the rear, peek at the front, and dequeue the earliest value using a circular buffer.
Follow stable node identities, next links and head/tail updates while inserting, deleting and traversing a singly linked list.
Trace integer keys into buckets, compare colliding keys, and update or remove entries while watching chain length and load factor.