Data Structures & Algorithms — Full Course

This course is different from the others on this site — instead of one language’s syntax, it teaches ways of organizing data and solving problems that apply across all of them: Big O notation, core data structures, searching and sorting algorithms, and recursion.

Every lesson is written, not filmed: read at your own pace, and use the Back and Forward buttons to move through the course in the order it was designed. Code examples use Python for readability, but every concept applies identically in every language covered on this site.

What you will learn

• Big O notation for measuring efficiency
• Stacks, queues, and linked lists
• Trees and hash tables
• Searching and sorting algorithms
• Recursion

Who this is for

Anyone who has taken at least one language course on this site and wants to understand not just how to write code, but how to reason about whether it will actually perform well as data grows — genuinely the material most technical interviews focus on.