Phase 4: Computational Thinking & Algorithms · ~30 minutes · Python · uv

Choosing the Right Data Structure

if x in my_list works perfectly at 50 items and becomes a real, measurable bottleneck at 50,000 — and the fix is one word: set.

Hiring signal: Chooses list vs. dict vs. set vs. tuple based on the actual access pattern needed, not habit

What you will learn

Choose between list, dict, set, and tuple based on lookup speed, order, and mutability needs
Explain why 'just use a list for everything' silently causes a real performance cliff at scale
Profile a real bottleneck and fix it by switching data structures
Justify a data structure choice for a new scenario, not just recall a rule

Introduction

Type: Learn Languages: Python Prerequisites: Lesson 04 (Recursion) Time: ~30 minutes

Objective

Learning objectives

Choose between list, dict, set, and tuple based on lookup speed, order, and mutability needs
Explain why "just use a list for everything" silently causes a real performance cliff at scale
Profile a real bottleneck and fix it by switching data structures
Justify a data structure choice for a new scenario, not just recall a rule

What you're building

A script (data_structure_audit.py) that:

Reproduces this lesson's list-vs-set membership timing at n = 500, 4000, 16000, printing both and their ratio
Given this scenario — "track a queue of support tickets in the order they arrived, and frequently check whether a specific ticket ID is already in the queue" — implements a solution using both a list and a dict/set together (one for order, one for fast lookup), and explains in a comment why a single structure alone can't satisfy both needs well
Contains a comment answering, for three new scenarios of your own invention, which of list/dict/set/tuple fits best and why

You need to store a fixed sequence of RGB color values (like (255, 0, 0) for red) that should never change once created, and you need to preserve their order. Which data structure fits best?

This scenario asks for two things at once: order preservation (rules out set, which has no order guarantee for arbitrary use) and immutability (rules out list, which can be mutated in place). A tuple satisfies both simultaneously — ordered, and permanently fixed once created, exactly matching Phase 02's 'immutability is a promise' framing for when a tuple is the deliberate right choice, not just 'an immutable list.' A dict solves a different problem (named lookup), which isn't what's being asked for here at all.

Unlock the full lesson

You've read the first 2 sections. The rest of this lesson covers The Problem, Check Yourself, Key Terms & Next — plus a hands-on lab, quiz, and project artifact.

Create a free account to unlock Phase 0 and Phase 1 of every course — no credit card.