All Coding Courses

Build a complete Roblox escape game in Luau, a feature per lesson: dark rooms joined door to door, a flashlight, keys and a vault code, and a monster that finds its way to you around the walls, while you hide in closets, sprint, and race the clock to the way out.

Certificate on completion

• 20
• 20
• 1
• 60

Build a complete Roblox sword fighting game in Luau, a feature per lesson: a sword with a hitbox, abilities on keys and phone buttons with server cooldowns, combos, stuns and blocks, and bots that chase you around pillars and fight back.

Certificate on completion

• 20
• 20
• 1
• 60

Build a complete Roblox tower defense game in Luau, a feature per lesson: enemies that walk a path in waves, towers you place and upgrade, splash and frost, health bars, a boss, and a base to defend.

Build a complete Roblox pet simulator in Luau, a feature per lesson: coin piles, a HUD, client and server talking through remotes, eggs with rarities, pets that follow you, a zone gate, rare-pet news and saves.

Build a complete Roblox tower obby in Luau, a feature per lesson: random towers stacked from stages, kill bricks, spinners, vanishing steps, conveyors, lasers, bounce pads, rising lava, rounds, checkpoints and best times. Play it in the browser and share it.

Certificate on completion

• 18
• 18
• 1
• 55

Build a complete Roblox tycoon in Luau, a feature per lesson: droppers, a conveyor, gold ore, buy pads, an upgrader, unlocks, rebirths and saves. Play your factory in the browser and share it.

Build a complete Roblox disaster survival game in Luau, a feature per lesson: a lobby, a round loop, maps, a flood, meteors, a shrinking island, lava, survivor tags, streaks and saved wins. Play it in your browser and share it.

Build, address and troubleshoot small networks in a terminal lab: hosts, switches and routers, cables, IPv4 addresses and masks, ARP, gateways, routing tables, and the classic faults that break real LANs.

Computer Networking

Certificate on completion

• 35
• 35

Master IP addresses from the bits up: binary, IPv4 anatomy, subnet masks, CIDR, subnetting drills, private ranges, network planning with VLSM, and a first look at IPv6. Practice everything in the terminal.

Computer Networking

Certificate on completion

• 46
• 46

How networks really talk, one layer at a time: the seven OSI layers, MACs and ARP, IP and routing, TCP, UDP and ports, encapsulation, and the full journey of a packet, with hands-on terminal walkthroughs.

Computer Networking

Certificate on completion

• 32
• 32

Learn how machines actually talk to each other, from the command line. Addresses and DNS, ports and sockets, whether a host is reachable, and HTTP by hand with curl: GET, POST, headers, status codes and HTTPS. Built for IT, support and backend work.

Computer Networking

Certificate on completion

• 47
• 47
• 141

In this course, you will learn about the AVL Tree data structure, build a self-balancing binary search tree from zero in your preferred language, and practice coding challenges with it!

Data Structures

Certificate on completion

• 16
• 14
• 1

Master Prim's Algorithm for Minimum Spanning Trees: grow one tree from a start vertex by always adding the cheapest crossing edge. Build it in your language of choice and answer bottleneck-edge and connectivity queries, the counterpart to Kruskal.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 55

Master Kruskal's Algorithm for Minimum Spanning Trees. Build union-find, grow an MST by adding the cheapest cycle-free edge in your language of choice, and answer connectivity and bottleneck-edge queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 57

Master the Bellman-Ford algorithm: single-source shortest paths that work with negative edge weights, plus negative-cycle detection. Build a relaxation pass, the full algorithm in your language of choice, and answer distance and cycle queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 54

Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 54

Master Topological Sort, the ordering of a directed acyclic graph so every edge points forward. Compute in-degrees, build an order with Kahn's algorithm in your language of choice, detect cycles, and find the longest path in a DAG.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 55

Master Breadth-First Search, the layer-by-layer graph traversal behind shortest paths. Build the neighbor lookup, write an iterative BFS with a queue in your language of choice, and use it to find shortest-path distances in unweighted graphs.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 54

Master Depth-First Search, a fundamental way to explore a graph. Build the adjacency lookup, write an iterative DFS in your language of choice, analyze its O(V + E) complexity, and use it to count and measure connected components.

Graph Algorithms Courses

Certificate on completion

• 9
• 4
• 1
• 54

Master Counting Sort, a non-comparison algorithm that sorts non-negative integers in linear time by tallying values. Build the counting phase, write the full sort in your language of choice, analyze its O(n + k) complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 4
• 1
• 52

Master Radix Sort, a non-comparison algorithm that sorts non-negative integers digit by digit. Build the stable counting-sort pass, write the full sort in your language of choice, analyze its linear-time behavior, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 4
• 1
• 55

Master Heap Sort, the array-based binary heap turned into a sorting algorithm. Build the sift-down step, write the full sort in your language of choice, analyze its O(n log n) time and O(1) space, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 4
• 1
• 54

Master Quick Sort, one of the fastest sorting algorithms in practice. Build the partition step, write the full recursive sort in your language of choice, analyze its complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 4
• 1
• 52

Master Merge Sort, the classic divide and conquer algorithm. Build the merge step, write the full recursive sort in your language of choice, analyze its O(n log n) complexity, and practice with coding challenges.

Data Structures

Certificate on completion

• 9
• 4
• 1
• 52