Search courses ranked by devsStop wasting time. Search coding courses, tutorials, and books — ranked by developers who voted for themSee how→
Learn Data Structures and Algorithms in Python
Extra perks unlocked via skillcraft.ai link
Build data structures from scratch and learn how to think through complex algorithms in Python. Practice your hard problem-solving skills and write faster code to feel confident in interviews. You'll build data structures from scratch in Python and improve your problem-solving skills. We'll cover binary trees, linked lists, stacks, graphs and more. This Python course will give you the foundation you need to start your career off on the right foot. After completing this course, you'll be comfortable crushing interview questions and writing performant code.
Instructor
Lane Wagner
Lane is a back-end engineer and the lead instructor of Boot.dev. He has taught over one million students worldwide, on Boot.dev, FreeCodeCamp, YouTube and the Backend Banter podcast. Lane worked as a backend engineer writing Go, Python and TypeScript, then moved into engineering management and a couple of years later left to build Boot.dev full-time.
Course details
32 hours
video
Included
Freemium
What you'll learn
Build data structures from scratch in Python, including stacks, queues, and linked lists
Master Big-O notation and time complexity analysis for efficient algorithm design
Implement and optimize sorting algorithms to improve data handling
Understand and apply graph algorithms like BFS and DFS for complex problem solving
Prerequisites
Basic Python programming knowledge
Understanding of functions and basic control flow
Familiarity with Python syntax and data types
Who this course is for
Python developers wanting to master data structures and algorithms
Students preparing for technical interviews and coding challenges
Developers seeking to improve code efficiency and problem-solving skills
Curriculum
Algorithms Intro
Math
Big-O Analysis
Sorting Algorithms
Exponential Time
Data Structures Intro
Stacks
Queues
Linked Lists
Binary Trees
Red Black Trees
Hashmaps
Tries
Graphs
BFS and DFS
P vs NP
Notice something missing?
Help us improve this course information for the community