Home โ€บ Learning paths โ€บ Lists and Dictionaries

๐Ÿ“ฆ Lists and Dictionaries โ€” learning path

๐Ÿ“ฆ Beginner20 problemsFree ยท no login needed

What this path teaches

Python's two workhorse containers, taught through their two signature crashes โ€” IndexError and KeyError โ€” and their quieter traps: aliasing, methods that return None, and slices that silently come back empty.

By the end: You can index, slice, copy, and look up safely โ€” and explain reference vs copy.

Your progress

0 of 20 opened

Start the path โ†’

The problems, in order

  1. 1Wrong index to get the last item
    ๐Ÿ› Fix the bug ยท easy
  2. 2Incorrect list index
    ๐Ÿ› Fix the bug ยท easy
  3. 3Negative indexing
    ๐Ÿ”ฎ Predict the output ยท easy
  4. 4Slicing does not include the end index
    ๐Ÿ”ฎ Predict the output ยท easy
  5. 5Slicing with the wrong direction
    ๐Ÿ› Fix the bug ยท medium
  6. 6List copy vs reference
    ๐Ÿ”ฎ Predict the output ยท easy
  7. 7List multiplication
    ๐Ÿ”ฎ Predict the output ยท medium
  8. 8Adding a number to a list wrong way
    ๐Ÿ› Fix the bug ยท easy
  9. 9Reversing a list the wrong way
    ๐Ÿ› Fix the bug ยท medium
  10. 10Sorting doesn't return a new list
    ๐Ÿ› Fix the bug ยท medium
  11. 11Wrong method to check if list is empty
    ๐Ÿ› Fix the bug ยท easy
  12. 12Wrong function to find list length
    ๐Ÿ› Fix the bug ยท easy
  13. 13Accessing a missing dictionary key
    ๐Ÿ› Fix the bug ยท medium
  14. 14Wrong dictionary key
    ๐Ÿ› Fix the bug ยท easy
  15. 15Dictionary get with default
    ๐Ÿ”ฎ Predict the output ยท easy
  16. 16Checking key existence the wrong way
    ๐Ÿ› Fix the bug ยท medium
  17. 17Deleting a key that doesn't exist
    ๐Ÿ› Fix the bug ยท easy
  18. 18Wrong syntax for adding a new key
    ๐Ÿ› Fix the bug ยท easy
  19. 19Dictionary keys must be unique
    ๐Ÿ”ฎ Predict the output ยท medium
  20. 20Nested dictionary access
    ๐Ÿ”ฎ Predict the output ยท medium

How to work a path

Do the problems in order โ€” each one assumes the rule taught by the one before it. Open a problem, try it in the interactive editor, and only then read the explanation. Progress is saved in this browser automatically (signed-in solves also earn XP and streaks). One path per week is a solid pace; finishing in a single sitting is allowed but not required.