• Self-paced interactive learning
• Ability to code in Python within your browser and execute the results
• Modularized learning

O’Reilly interactive learning platform offers a free 10-day trial. Check these out!

You can search the full list of available Katacoda scenarios authored by George Heineman. The scenarios below are now available.

Analyzing Algorithms

• Classifying Algorithms
• Sample Algorithm with O(N!) Classification
• Sample Algorithm with O(2^N) Classification

Problem Solving

• Finding Largest Value with Two Kinds of Problem Instances of size N
• Finding Second Largest Value in List
• Finding Largest Value Using Recursion

Hashtable Structures

• Visualizing Open Addressing
• Visualizing Separate Chaining
• Hashing Functions in Practice

Binary Heap Structure

• Visualizing Binary Heaps
• Implementing Binary Heaps
• Finding k Smallest Values in an Unordered List of N Values

Sorting Algorithms

• Insertion Sort
• Merge Sort
• Quicksort Variations

Binary Trees

• Working with Binary Search Trees
• Traversing Binary Trees
• Self-Balancing AVL Binary Trees

Graph Algorithms

• Constructing Graphs Using NetworkX
• Searching Graphs Using Breadth-First and Depth-First Search
• Single-Source Shortest Path
• All-Pairs Shortest Path

Capstone Skyline Problem

• Solve the Skyline Problem
• Revisiting the Skyline Problem