Data structures such as arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs determine how a program stores data and how fast it can search, insert, and remove items. Big O notation describes how the number of steps grows as the input grows.
We just published a course on the freeCodeCamp.org YouTube channel that will teach you data structures and algorithms in Python, with every topic explained through custom animations and visualizations alongside Python code examples. This course is taught by Javid Bodurov.
The course is for beginners and only assumes the basics of Python: variables, loops, functions, and lists. You build each structure yourself, then compare it with tools Python already has, such as dict, set, deque, and heapq.
In this course, you will learn:
- Big O, Arrays & Linked Lists
How to measure how a program's steps grow, how data lives in memory, and why inserting at the head of a linked list changes only two pointers. - Stacks, Queues & Hash Tables
How to solve the balanced brackets problem with a stack, use deque for fast queues, and handle collisions in a hash table. - Trees, Heaps & Graphs
How binary search trees keep values ordered, how a heap gives you the smallest value first, and how breadth first search, depth first search, and Dijkstra's algorithm work on graphs. - Recursion, Searching & Sorting
How memoization fixes a slow recursive Fibonacci, how binary search works on a sorted list, and how bubble, selection, insertion, merge, and quick sort compare. - Problem-Solving Patterns & Interview Problems
How to recognize patterns such as two pointers and sliding windows, then bring everything together to approach coding interview problems.
Watch the full course on the freeCodeCamp.org YouTube channel (2.5-hour watch).
