Data Structures in Practice

An array stores elements in contiguous indexed positions.

Decide whether any value occurs more than once, and compare a set-based solution with sorting the input.

Return the indices of two distinct values whose sum equals the target.

A hash table transforms a key into a hash value and uses part of that value to select a bucket or slot.

Follow the key state changes and boundary checks involved in hash tables: from keys to buckets.

An interactive concept flow for hash tables: from keys to buckets, from its assumptions through the main operation and boundary checks.

Implement get and put in constant average time while evicting the least recently used key at capacity.

A search tree organizes keys so comparisons guide a search toward one subtree.

Return the k values with the highest frequency; define a deterministic tie policy for your implementation.

Design a structure that accepts numbers one at a time and reports the median of all values seen.

Explain the model, execution steps, complexity, and limits of trees and heaps solve different ordering problems.