Home โบ Problems โบ List slicing and indexing
List slicing and indexing
๐ง Predict the output Topic: lists Difficulty: easy Premium
What this problem practises
Lists are mutable and assigned by reference. That one fact explains most list bugs: aliasing between what look like "copies", append() and sort() returning None, and slice boundaries that disagree with the index arithmetic.
This is an output-prediction problem: read the snippet carefully and write down exactly what it prints before anything runs. These questions are interview staples because they test whether you know the language rules, or merely recognise their syntax.
Difficulty: easy โ the fix or the trick is normally a single line, and a careful read should be enough.
The challenge
This is a premium problem. Premium unlocks the complete catalog and an ad-free editor; every hint on every problem is free for all learners.
Keep going
- Output-prediction strategies โ how to predict tricky snippets without running them.
- Browse every lists problem in this topic.
- Common Python errors and what they actually mean, plus the Python glossary for any term used on this page.