Tech
English
Dart's core libraries go further than most, with a Queue, a LinkedList and splay trees in dart:collection, but the core SDK has no heap or priority queue. This path has you build every structure in Dart, where sound null safety makes each missing link a Node? you must check, then sort, recurse and search graphs with them, and finish on graded interview problems. Free, in your browser, with a certificate on most courses.
377 lessons228 challenges702 quiz questions
AI-assisted coding help
Hands-on interactive lessons
Audio narration on every lesson
Quizzes to test your knowledge
23 free certificates along the pathEach step is a set of existing Coddy courses, and every Start button opens them in Dart. The three courses not taught in Dart yet are listed after the steps.
List, Queue and Map do for you, and why a Map literal remembers the order you inserted its keys.StartDoubleLinkedQueue is a structure you have written, the heap the core SDK lacks is one you can write, and SplayTreeMap is an ordered tree you understand: self-adjusting where yours is height-balanced.StartList.sort takes a comparator such as (a, b) => a.compareTo(b); after this step you can write the algorithm behind that call.StartNode? has to deal with null before it can recurse, and type promotion lets it use the node freely after that check. A runaway recursion ends in a StackOverflowError. Dynamic programming and bit manipulation are listed after the steps, since they are taught in Python and C++.StartDedicated pageWrite 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 LinkedInNode? you have to check before you follow it. The null-pointer crash other languages find at runtime, Dart's compiler reports while you are still writing the structure.&, |, ^, ~, << and >>.Node<T> class with a nullable next is exactly what it looks like, and dart:collection covers more than most standard libraries. Two things are worth knowing: the core SDK has no priority queue, and a Map or Set literal is a LinkedHashMap or LinkedHashSet, which remembers insertion order: handy for output, but not the same promise as a sorted map.List is a dynamic array and your stack; Map and Set are hash tables, insertion-ordered by default; dart:collection adds Queue (a ListQueue, a ring buffer, unless you choose DoubleLinkedQueue), LinkedList for entries that extend LinkedListEntry, and SplayTreeMap and SplayTreeSet, self-adjusting ordered trees. For a heap, the Dart team's package:collection provides PriorityQueue. Tries and graphs you write yourself.dart:collection stops at queues, linked lists and splay trees, and PriorityQueue lives in package:collection, a package the Dart team maintains but you add yourself. That makes a heap a fair thing for a Dart interview to ask you to write, and step two is where you write one.SplayTreeMap?SplayTreeMap when you need keys in sorted order, the smallest or largest key, or the nearest key on either side of a value, through firstKeyAfter and lastKeyBefore. The AVL tree you build in step two takes the other approach, rebalancing on every change to keep its height strictly bounded.List or a Map, and toRadixString(2) prints an int in binary, the quickest way to check what a mask actually holds.