Tech
English
Python is the most complete way to take this path: every course is taught in it except bit manipulation, which is C++ only and listed after the steps. You build the stack, the hash table, the heap and the AVL tree yourself, so list, dict, deque and heapq stop being magic, then prove it on graded interview problems. Free, in your browser, with a certificate on most courses.
404 lessons228 challenges702 quiz questions
AI-assisted coding help
Hands-on interactive lessons
Audio narration on every lesson
Quizzes to test your knowledge
24 free certificates along the pathEach step is a set of existing Coddy courses, and every Start button opens them in Python. The one course not taught in Python, bit manipulation, is listed after the steps.
list, deque and dict do for you, and what they cost.Startheapq is a binary heap you have written, and the balanced tree Python never gave you is one you can build.Startsorted() is Timsort, a hybrid of merge sort and insertion sort, and after this step you can say why that is a good idea.Start&, |, ^, << and >> are Python's operators too, so it still reads easily.Startheapq: the heap from step two, in library form.StartWrite real code, query databases, build websites, and master AI prompts. Our interactive lessons cover every skill modern developers need.
Stay consistent and watch your progress grow! Track your daily coding habit, protect your streak with freeze days, and earn rewards for showing up every day.
12 days streak
Return tomorrow to keep your streak!
January 2026
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
21
22
23
24
25
26
27
28
29
30
Double or Nothing
Day 5 of 7
Streak Freeze
2 left
Take your coding journey on the go! No setup, no downloads - just open and start coding. Available on iOS, Android and Web with 4.9 star ratings.
Compete on global leaderboards, invite friends to earn rewards, and celebrate each other's wins. Coding is better with friends!
1
2
3
Promotion zoneRead, listen, test yourself, ask the AI, or look up anything you've already covered. Every lesson meets you where you are.
A variable is a named container that stores a value you can reference later in your program.
In Python, you create one by writing the name, an equals sign, then the value you want to store.
The value can change over time - reassigning the name simply points it to a new value.
Earn certificates for every course you complete. Add them to your LinkedIn profile and resume to showcase your coding expertise to employers.
Certificate of CompletionPython Fundamentals
Add to LinkedInlist, dict, set, deque and heapq. Building the structures behind them is how you learn why list.pop(0) is slow, why a dict lookup is constant time on average, and when a heap beats sorting, which is exactly what an interviewer asks after you use one.list (a dynamic array), dict and set (hash tables), tuple, collections.deque (a queue that is fast at both ends), heapq (a binary min-heap on a list) and collections.Counter. Know what each operation costs, not just its name. Python has no built-in linked list, tree, trie or graph, so those you write yourself, in steps one and two.list pays for every pop(0), because every remaining element shifts one place; deque.popleft() does not. Implementing each structure once is how you learn the costs well enough to pick the right one without thinking.RecursionError. You can raise the limit with sys.setrecursionlimit, but the better habit, and the one interviewers like to see, is knowing how to replace the recursion with a loop and an explicit stack: the structure you build in step one.