Search Coddy's catalog of 121 interactive coding courses for "web". Browse hands-on lessons across 16 programming languages, free to start.

Search results for "web" - Coding Courses | Coddy

121 Free Interactive Courses

Python

Java

JavaScript

Dart

Ruby

Rust

Swift

HTML

Data Structures

Data Structures Courses

Interview Preparation

Coding Interview Preparation Courses

Graph Algorithms Courses

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.

Prim's Algorithm - Graph Algorithms

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.

Kruskal's Algorithm - Graph Algorithms

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.

Bellman-Ford Algorithm - Graph Algorithms

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.

Dijkstra's Algorithm - Graph Algorithms

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.

Topological Sort - Graph Algorithms

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.

Breadth-First Search - Graph Algorithms

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.

Depth-First Search - Graph Algorithms

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.

Counting Sort - DSA Series

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.

Radix Sort - DSA Series

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.

Heap Sort - DSA Series

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.

Quick Sort - DSA Series

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.

Merge Sort - DSA Series

Master Selection Sort, one of the simplest sorting algorithms. See how it works step by step, build it from scratch in your language of choice, analyze its complexity, and practice with coding challenges.

Selection Sort - DSA Series

In this course, you will learn about the Graph data structure, create an undirected graph from zero in your preferred language, and practice coding challenges with it!

Graphs - Data Structures Series #9

In this course, you will learn about the Trie (prefix tree), create one from zero in your preferred language, and practice coding challenges with it!

Tries - Data Structures Series #8

In this course, you will learn about the Heap data structure (the backbone of priority queues), create a MinHeap from zero using your preferred language, and practice coding challenges with it!

Heaps & Priority Queues - Data Structures Series #7

In this course, you will learn about the Doubly Linked List data structure, create a Doubly Linked List from zero using your preferred language, and practice coding challenges with it!

Doubly Linked List - Data Structures Series #6

In this course, you will learn about the Linked List data structure, create a Linked List from zero using your preferred language, and practice coding challenges with it!

Linked List - Data Structures Series #5

In this course, you will learn about the Hash Table data structure, create a Hash Table from zero using your preferred language, and practice coding challenges with it!

Hash Tables - Data Structures Series #4

In this course you will create amazing "Solar Eclipse" Animation. Showcasing how we can create engaging and functional user interfaces using animation.

Solar Eclipse Animation | HTML/CSS Project

In this course you will practice standard and simple HTML & CSS approaches and create an Instagram Page Clone Project

Instagram Page Clone | Front-End Project

Learn how to efficiently manipulate and transform data using R's built-in functions, base packages and supported packages. Topics include subsetting, merging, reshaping, and aggregating data.

Data Manipulation in R

In this course you will learn about iterators in Python and practice your knowledge, after this course you will be able to master this topic!

Python Iterators

In this course, you will learn about JSON and dive into the json library in Python, and master it!

All Coding Courses

Start learning with Coddy