PYTHON DSA

Python · Data Structures · Algorithms

Python DSA Roadmap

Master data structures and algorithms with Python. Follow a structured roadmap, understand important concepts, practice problem-solving patterns, and track your preparation as you progress toward coding interviews.

Python Fundamentals Problem Solving Coding Interviews Revision Tracker
Total Topics
0
Completed
0
Marked for Revision
0
Your Progress
0%
Your learning progress 0 of 0 topics completed

Learning Roadmap

Expand a module, study its topics, and track your progress.

Learn the Python features used frequently in coding interviews, including collections, iteration, functions, and complexity basics.

Variables, Data Types & Operators
Conditionals, Loops & Iteration
Functions, Scope & Lambda
Lists, Tuples & List Comprehensions
Dictionaries, Sets & Hashable Objects
Strings, Slicing & Common Methods
Time & Space Complexity with Big O
Python quick example
numbers = [4, 2, 7, 1, 9]

# Traverse a list
for number in numbers:
    print(number)

# Dictionary for frequency counting
frequency = {}
for number in numbers:
    frequency[number] = frequency.get(number, 0) + 1

print(frequency)

Practise list manipulation, in-place operations, prefix sums, two pointers, and sliding-window problems.

Array Basics, Traversal & Indexing
In-place Operations & Reversal
Two Pointers
Sliding Window
Prefix Sum & Difference Arrays
Subarrays & Maximum Subarray Sum
Intervals & In-place Merging

Learn common string interview patterns and how to solve problems using character counts, pointers, and matching.

String Traversal & Manipulation
Character Frequency & Anagrams
Palindrome Problems
Pattern Matching & Substrings
KMP Algorithm & Prefix Function

Understand sorting trade-offs, binary search templates, and searching over a monotonic answer space.

Bubble, Selection & Insertion Sort
Merge Sort & Quick Sort
Binary Search Fundamentals
Binary Search on Answer
Lower Bound, Upper Bound & Rotated Arrays

Use dictionaries and sets to reduce repeated searches and solve frequency and lookup problems efficiently.

Hash Maps & Hash Sets
Frequency Counting & Duplicate Detection
Prefix Sum with Hash Maps

Learn how linked nodes work and practise pointer-based algorithms, including reversal and cycle detection.

Nodes, Traversal & Insertion
Reverse a Linked List
Fast & Slow Pointers, Cycle Detection
Merge Lists & Find the Middle Node

Learn how to select the right structure for order-dependent problems and efficient processing.

Stack Operations & Applications
Queue, Deque & collections.deque
Monotonic Stack & Next Greater Element
Valid Parentheses & Expression Problems

Break problems into smaller subproblems, then explore possible choices while undoing decisions when necessary.

Base Cases, Call Stack & Recurrence
Divide and Conquer
Subsets, Permutations & Combinations
Constraint Search & Pruning

Practise hierarchical data structures, recursive traversals, and efficient minimum or maximum retrieval.

Binary Trees & Tree Terminology
Preorder, Inorder, Postorder & Level Order
Binary Search Trees
Height, Diameter, Ancestors & Path Problems
Min-Heap, Max-Heap & heapq
Top-K Elements & K-way Merging

Learn graph representations and practise traversal, connectivity, topological ordering, and path algorithms.

Adjacency Lists & Adjacency Matrices
Breadth-First Search & Depth-First Search
Connected Components & Cycle Detection
Topological Sorting
Shortest Paths: BFS & Dijkstra
Minimum Spanning Trees: Prim & Kruskal

Learn how to recognise greedy choices and understand when a greedy strategy is valid.

Greedy Strategy & Proof Intuition
Interval Scheduling & Activity Selection
Job Scheduling & Greedy Assignments

Identify overlapping subproblems, define states, build transitions, and optimise recursive solutions.

Overlapping Subproblems & Optimal Substructure
Memoization & Tabulation
1D DP: Fibonacci, Climbing Stairs & House Robber
2D DP: Grid Paths & Common Subsequences
Knapsack & Subset Sum
Longest Increasing Subsequence

Practise bitwise operations, number properties, and mathematical techniques that simplify coding problems.

AND, OR, XOR, NOT & Bit Shifts
Set, Clear, Toggle & Check Bits
Prime Numbers & Sieve of Eratosthenes
GCD, LCM & Euclidean Algorithm

Consolidate your skills with recurring patterns, mixed-topic problems, and deliberate practice.

Tries & Prefix Trees
Disjoint Set Union (Union-Find)
Monotonic Queue & Advanced Window Problems
Mixed DSA Practice & Interview Patterns
No topics match your search or selected filter. Try another keyword or select All Topics.
i

Study actively, not passively. Understand the approach, implement it yourself, analyse time and space complexity, and revisit difficult topics using the star and notes controls. Your tracker is saved in this browser.

Share