Data Structures & Algorithms with Python
Learn DSA concepts with Python's elegant syntax and powerful built-in data structures
Limited offer1k/mo1.5k/mo
Duration
16 weeks
Level
Intermediate
Mode
Online
Course Roadmap
Weeks 1-2: Python Fundamentals & OOP
- Python syntax, data types, and control flow
- Functions, modules, and packages
- Classes, objects, and inheritance in Python
Weeks 3-4: Lists, Tuples & Strings
- Python lists and list comprehensions
- String manipulation and regular expressions
- Two-pointer and sliding window techniques
Weeks 5-6: Linked Lists Implementation
- Custom linked list implementation in Python
- Doubly linked lists and circular lists
- Cycle detection and reversal algorithms
Weeks 7-8: Stacks, Queues & Deques
- Stack implementation using lists and collections
- Queue and deque from collections module
- Priority queues using heapq module
Weeks 9-10: Trees & Binary Search Trees
- Binary tree implementation and traversals
- BST operations and validation
- Tree algorithms and recursive solutions
Weeks 11-12: Heaps & Hash Tables
- Python heapq module and custom heap implementation
- Dictionaries and sets in Python
- Hash function design and collision resolution
Weeks 13-14: Sorting & Searching
- Built-in sorting and custom sort functions
- Implementing classic sorting algorithms
- Binary search and bisect module
Weeks 15-16: Graphs & Dynamic Programming
- Graph representation using dictionaries and lists
- BFS, DFS, and shortest path algorithms
- Dynamic programming with memoization and tabulation
Prerequisites
Basic Python programming knowledge and understanding of fundamental programming concepts