Maps often remove a nested loop by storing exactly the state needed for a future lookup.
Loading Engineering Foundry…
Loading Engineering Foundry…
Trade memory for fast membership, counting, grouping, and lookup.
Maps often remove a nested loop by storing exactly the state needed for a future lookup.
Explain average-case lookup and recognize when ordering or collisions alter the choice.
These clues narrow the model. They do not replace an invariant or complexity check.
Exact active distribution: 5 easy, 5 medium, 0 hard. External records contain metadata and original guidance only.
Practice exact count updates under a stream of additions and removals.
Process a sequence of item updates. Each update contains an item name and an integer delta. Return the item names whose final counts are positive, ordered by first appearance. Counts may reach zero but may never become negative.
Maintain the smallest valid left boundary as characters repeat.
Separate counting from selecting the highest-frequency keys.
Map each original node to exactly one clone before following cycles.
Build an adjacency model from route membership and traverse with bounded transfers.
A transit network lists the stops served by each route. Given a start stop, destination stop, and maximum number of route transfers, determine whether the destination is reachable. Avoid revisiting both stops and routes.
Question pages let you record local completion. Account status, confidence, notes, and a topic roll-up are shown only when private account persistence is available.
Open practice workspaceLearn the reusable movement and state patterns that remove brute-force work.
Open the roadmap