

Algorithm Courses
This course offers numerous interactive coding challenges to help you comprehend and implement algorithms quickly. The challenges were designed by Donne Martin and are available in the GitHub repository donnemartin/interactive-coding-challenges.
Completed 0 of 90 Labs
Arrays and Strings
Permutation Check of String Pairs
Solving the Two Sum Problem
Compress String Using Python
Implement Hash Table with Key-Value Operations
Find Differing Character in Strings
Implement Fizz Buzz in Python
String Compression Challenge
Reverse String In-Place Programming
Unique Character String Validation
Determine String Rotation in Computer Science
Efficient Array-Backed Priority Queue Implementation
Linked Lists
Stacks and Queues
Graphs and Trees
Breadth-First Search Graph Traversal Algorithm
Graph Shortest Path
Depth-First Traversal of Binary Trees
Balanced Binary Tree in Python
Binary Tree Lowest Common Ancestor
Graph Data Structure Fundamentals
Trie Data Structure for String Storage
Bst Second Largest
Graph Build Order
Min Heap Binary Tree Introduction
Determine Binary Tree Height
Binary Search Tree In-Order Successor
Depth-First Search on Directed Graphs
Inverting Binary Tree Technique
Breadth-First Traversal Binary Tree
Minimal Height Binary Search Tree
Graph Shortest Path Unweighted
Graph Path Exists
Validating Binary Search Tree
Binary Search Tree Implementation in Python
Tree Level Lists
Sorting and Searching
Rotated Array Search
Efficient Merge Sort Algorithm Implementation
Search Sorted Matrix
Efficient Quick Sort Algorithm
Sorting with Selection Algorithm
Merge Sorted Arrays into One
Missing Integer in Array
Anagram Sorting Array
Efficient Insertion Sort Algorithm
Radix Sort: Efficient Integer Sorting Algorithm
Recursion Dynamic
Fibonacci Sequence Programming Tutorial
Max Profit K
Longest Inc Subseq
Solving the Towers of Hanoi Problem
Generating All Permutations of Input String
N Pairs Parentheses
Coin Change Ways
Longest Common Subsequence
Exploring Step Climbing with Python
Knapsack Problem Optimization Techniques
Coin Change Min
Generating Power Sets in Python
Unbounded Knapsack Optimization Problem
Longest Substr K Distinct
Optimizing 2x2 Matrix Multiplication
Identifying Magic Indexes in Arrays
Python Challenge: Longest Common Substring
Optimal Coin Change Solution
Robot Grid Path Planning
Math Probability
Bit Manipulation

