Java-first · Beginner to expert

Data Structures & Algorithms

The complete curriculum, from first principles to specialist algorithms. Algorithm lessons let you edit the input and watch every step run: pointers move, values swap and the matching Java line lights up.

Teaching parts

Chapters

538

Lessons

2764

Topics

Published293 / 538 lessons · 1625 / 2764 topics

Part I

Foundations, Programming and Algorithmic Thinking

Beginner

Part II

Linear Data Structures and Core Collections

Beginner / Intermediate

Arrays and Dynamic Arrays

9 lessons63 topics9/9 live

Strings and Character Processing

8 lessons53 topics8/8 live

Matrices, Grids and Multidimensional Arrays

7 lessons37 topics7/7 live

Linked Lists

9 lessons50 topics9/9 live

Stacks and Stack-Based Algorithms

7 lessons38 topics7/7 live

Queues, Deques and Circular Buffers

7 lessons38 topics7/7 live

Hash Tables, Maps and Sets

9 lessons52 topics9/9 live

Data Structure Selection and Implementation Trade-offs

5 lessons31 topics5/5 live

Part III

Searching, Sorting and Selection

Beginner / Intermediate

Searching Algorithms

7 lessons36 topics7/7 live

Elementary Sorting Algorithms

6 lessons31 topics6/6 live

Efficient and Specialized Sorting

9 lessons46 topics9/9 live

Selection, Order Statistics and Ranking

6 lessons25 topics6/6 live

Part IV

Fundamental Algorithm Design Paradigms

Intermediate

Backtracking, Constraint Search and State Space

7 lessons37 topics7/7 live

Greedy Algorithms and Exchange Arguments

8 lessons37 topics8/8 live

Intervals, Events and Sweep-Line Algorithms

7 lessons34 topics7/7 live

Dynamic Programming: The Core Method

8 lessons40 topics8/8 live

Part V

Trees, Priority Structures and Range Queries

Intermediate / Advanced

Tree Fundamentals and Traversal

8 lessons50 topics8/8 live

Binary Search Trees and Ordered Sets

6 lessons33 topics6/6 live

Self-Balancing Search Trees and B-Trees

6 lessons34 topics6/6 live

Heaps and Priority Queues

7 lessons35 topics7/7 live

Tries, Prefix Trees and Dictionary Structures

7 lessons34 topics7/7 live

Fenwick Trees and Segment Trees

7 lessons39 topics7/7 live

Static Range Queries and Decomposition Techniques

6 lessons27 topics6/6 live

Disjoint Set Union (Union-Find)

5 lessons25 topics5/5 live

Part VI

Graph Algorithms and Tree-Graph Techniques

Intermediate / Advanced

Graph Theory Basics and Representations

6 lessons39 topics6/6 live

BFS, DFS and Graph Connectivity

7 lessons32 topics7/7 live

Directed Acyclic Graphs and Topological Ordering

6 lessons23 topics6/6 live

Shortest Paths and Weighted Graph Search

9 lessons38 topics9/9 live

Minimum Spanning Trees and Graph Connectivity

6 lessons24 topics6/6 live

Graph Dynamic Programming and DAG Applications

5 lessons20 topics5/5 live

Connectivity, Bridges, Articulation Points and SCCs

6 lessons25 topics6/6 live

Network Flow and Minimum Cuts

8 lessons37 topics8/8 live

Graph Matchings and Assignment

6 lessons22 topics6/6 live

Advanced Graph Structure and Specialized Graph Problems

8 lessons36 topics8/8 live

Advanced Tree Algorithms on Graphs

11 lessons46 topics

Part VII

Dynamic Programming: Comprehensive Problem Families

Intermediate / Advanced

Knapsack, Subset and Counting Dynamic Programming

6 lessons28 topics

Sequence and String Dynamic Programming

6 lessons24 topics

Grid, Interval, Partition and Game Dynamic Programming

6 lessons29 topics

Tree, Graph, Bitmask and Digit Dynamic Programming

7 lessons33 topics

Advanced DP Optimizations and State Techniques

9 lessons34 topics

Part VIII

String Algorithms and Text Indexing

Advanced / Expert

String Pattern Matching Algorithms

7 lessons34 topics

Suffix Structures and String Indexing

6 lessons25 topics

Palindromes and Combinatorics on Words

5 lessons20 topics

Advanced String Queries and Algorithms

5 lessons21 topics

Part IX

Number Theory, Combinatorics and Algebra

Intermediate / Expert

Number Theory and Prime Algorithms

7 lessons33 topics

Modular Arithmetic and Cryptographic Number Theory

7 lessons29 topics

Combinatorics, Counting and Enumeration

8 lessons34 topics

Probability, Expectation and Random Processes

6 lessons27 topics

Matrices, Linear Algebra and Recurrences

6 lessons24 topics

Polynomial Algorithms and Fast Transforms

6 lessons24 topics

Part X

Computational Geometry and Advanced Algorithms

Advanced / Expert

Computational Geometry Essentials

8 lessons36 topics

Advanced Computational Geometry

6 lessons24 topics

Randomized, Online and Streaming Algorithms

7 lessons29 topics

Algorithmic Complexity Theory and Approximation

7 lessons33 topics

Part XI

Advanced Data Structures and Offline Techniques

Advanced / Expert

Randomized and Self-Adjusting Search Structures

6 lessons26 topics

Persistence, Dynamic Trees and Specialized Range Structures

7 lessons29 topics

Offline Range Queries and Query Reordering

7 lessons24 topics

Bitsets, Succinct and Probabilistic Data Structures

7 lessons31 topics

Advanced Combinatorial and Search Algorithms

7 lessons28 topics

Part XII

Algorithm Engineering, Java Practice and Tutorial Publishing

Beginner to Expert

Algorithm Engineering and Production Performance

6 lessons30 topics

Java DSA Reference Implementations and Library Mapping

9 lessons59 topics

Testing, Debugging and Proving DSA Solutions

7 lessons37 topics

Interview Problem Patterns and Question Families

11 lessons62 topics

Practice Roadmap and Progressive Assessments

7 lessons47 topics

Tutorial Website Content Architecture and Publishing Checklist

10 lessons69 topics

Capstone Projects and End-to-End Applications

6 lessons31 topics

Reference

Appendices

Reference

Algorithm and Data Structure Complexity Reference

9 lessons32 topics

Common Algorithmic Glossary

5 lessons42 topics

Prerequisite Graph and Recommended Learning Order

5 lessons5 topics

Foundations, Programming and Algorithmic Thinking

Introduction to Data Structures and Algorithms

Java Prerequisites for DSA

Mathematical Foundations for DSA

Complexity, Memory and Performance Analysis

Recursion and Divide-and-Conquer Fundamentals

Bit Manipulation and Binary Representation

Foundational Problem-Solving Patterns

Linear Data Structures and Core Collections

Arrays and Dynamic Arrays

Strings and Character Processing

Matrices, Grids and Multidimensional Arrays

Linked Lists

Stacks and Stack-Based Algorithms

Queues, Deques and Circular Buffers

Hash Tables, Maps and Sets

Data Structure Selection and Implementation Trade-offs

Searching, Sorting and Selection

Searching Algorithms

Elementary Sorting Algorithms

Efficient and Specialized Sorting

Selection, Order Statistics and Ranking

Fundamental Algorithm Design Paradigms

Backtracking, Constraint Search and State Space

Greedy Algorithms and Exchange Arguments

Intervals, Events and Sweep-Line Algorithms

Dynamic Programming: The Core Method

Trees, Priority Structures and Range Queries

Tree Fundamentals and Traversal

Binary Search Trees and Ordered Sets

Self-Balancing Search Trees and B-Trees

Heaps and Priority Queues

Tries, Prefix Trees and Dictionary Structures

Fenwick Trees and Segment Trees

Static Range Queries and Decomposition Techniques

Disjoint Set Union (Union-Find)

Graph Algorithms and Tree-Graph Techniques

Graph Theory Basics and Representations

BFS, DFS and Graph Connectivity

Directed Acyclic Graphs and Topological Ordering

Shortest Paths and Weighted Graph Search

Minimum Spanning Trees and Graph Connectivity

Graph Dynamic Programming and DAG Applications

Connectivity, Bridges, Articulation Points and SCCs

Network Flow and Minimum Cuts

Graph Matchings and Assignment

Advanced Graph Structure and Specialized Graph Problems

Advanced Tree Algorithms on Graphs

Dynamic Programming: Comprehensive Problem Families

Knapsack, Subset and Counting Dynamic Programming

Sequence and String Dynamic Programming

Grid, Interval, Partition and Game Dynamic Programming

Tree, Graph, Bitmask and Digit Dynamic Programming

Advanced DP Optimizations and State Techniques

String Algorithms and Text Indexing

String Pattern Matching Algorithms

Suffix Structures and String Indexing

Palindromes and Combinatorics on Words

Advanced String Queries and Algorithms

Number Theory, Combinatorics and Algebra

Number Theory and Prime Algorithms

Modular Arithmetic and Cryptographic Number Theory

Combinatorics, Counting and Enumeration

Probability, Expectation and Random Processes

Matrices, Linear Algebra and Recurrences

Polynomial Algorithms and Fast Transforms

Computational Geometry and Advanced Algorithms

Computational Geometry Essentials

Advanced Computational Geometry

Randomized, Online and Streaming Algorithms

Algorithmic Complexity Theory and Approximation

Advanced Data Structures and Offline Techniques

Randomized and Self-Adjusting Search Structures

Persistence, Dynamic Trees and Specialized Range Structures

Offline Range Queries and Query Reordering

Bitsets, Succinct and Probabilistic Data Structures

Advanced Combinatorial and Search Algorithms

Algorithm Engineering, Java Practice and Tutorial Publishing

Algorithm Engineering and Production Performance

Java DSA Reference Implementations and Library Mapping