>_BeginnerCoder
Donate

Lesson 12 — Hash maps

Fast lookups

A dict gives O(1) lookups — ideal for counting and dedup.

Task

Find the first repeating character.

← Back
Next →

Enjoying this lesson? Share it 👇

Keep going with Data Structures

Ready for more? These paid resources pick up where this lesson leaves off.

Some links on this page are affiliate links: we may earn a commission at no extra cost to you. We only recommend tools we believe are genuinely useful.