Tech
English
Go gives you slices and maps and leaves the rest to you: no stack, queue or set type, and a heap in container/heap that does nothing until you implement heap.Interface. This path has you build every structure in Go with structs and pointers, 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 Go. The three courses not taught in Go yet are listed after the steps.
container/list is the first of them, ready-made; after this step the five methods of heap.Interface make sense, because you have built a heap yourself, and the balanced tree Go never shipped is one you can build.Startsort.Slice has used pattern-defeating quicksort since Go 1.19, slices.Sort uses it too, and neither is stable, which is why sort.SliceStable exists; after this step you know what each of those words means.Startcontainer/heap over a slice of your own type: the heap from step two, behind an interface.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 LinkedInappend to and reslice, a set is a map[T]struct{}, and there is no queue type or tree at all. Knowing how to write the missing ones, and what each slice operation costs, is part of knowing Go.struct with a pointer to the next one, and methods hang off the type. A linked list or a tree looks like exactly what it is, generics (since Go 1.18) make it reusable for any element type, and the garbage collector means there is no malloc or free to manage.&, |, ^, << and >> and writes NOT as ^x.container/list and container/heap, you write the structures yourself, which on a learning path is the point. Go also runs much of today's cloud infrastructure, Docker and Kubernetes included, which makes it a natural interview language for backend roles.append and reslicing it is also your stack; a map is a hash table, and map[T]struct{} is the idiomatic set; container/list is a doubly linked list; and container/heap runs a binary heap over any type that implements heap.Interface. There is no queue type, tree, trie or graph, so those you build yourself, in steps one and two.container/heap work in Go?heap.Interface on a slice type of your own: Len, Less and Swap from sort.Interface, plus Push and Pop, which only append to and remove from the end of the slice. Then you call the package functions heap.Push and heap.Pop, never your own methods, and they do the sifting up and down that keeps the order. It reads oddly until you have written a heap yourself, which step two has you do.&^, AND NOT, which clears in its left operand every bit set in its right.