Python DSA — Course

A full data structures & algorithms course in Python, built for competitive programming: complexity analysis through advanced structures.

Start reading →

011. Complexity Analysis 022. Arrays & Strings 033. Hashing 044. Stacks & Queues 055. Linked Lists 066. Binary Search 077. Sorting 088. Recursion & Backtracking 099. Trees 1010. Heaps 1111. Graphs 1212. Dynamic Programming 1313. Tries 1414. Advanced Structures 15Appendix: CP Quick Reference

Other tracks

Python DSA — Interview Prep Python DSA — Beginner Python Syntax & DSA Reference Git Mastery Cognitive Skills & Mental Tools Code Optimization Rules Objects First: OOP Fundamentals Patterns of Good Design Under the Hood: Operating Systems How the Bytes Travel: Networking Data at Rest, Data in Motion: Databases Sharing Time: Concurrency & Multithreading Clean by Default: Coding Standards The Review: Code Review From Idea to Production: the SDLC Designing at Scale: System Design Whiteboard to Blueprint: HLD & LLD Built to Last: Reliability & Scaling Tell Me About a Time: Behavioral Interviews