
Course
Learn DSA with Python
Learn Data Structures and Algorithms With Python to master the art of writing highly efficient code and ace your coding interviews.
Enroll for FREECourse Content
- 1.1 Introduction to DSA
- 1.2 Why Learn DSA?
- 1.3 Prerequisites
- 1.4 Python Lists
- 2.1 Sorting
- 2.2 Bubble Sort
- 2.3 Selection Sort
- 2.4 Insertion Sort
- 2.5 Merge Sort
- 2.6 Quick Sort
- 2.7 Counting Sort
- 3.1 Search Algorithms
- 3.2 Linear Search
- 3.3 Binary Search
- 4.1 Linked List
- 4.2 Linked List Operations
- 4.3 Examples: Linked List
- 5.1 Introduction to Circular Linked List
- 5.2 Circular Linked List Operations
- 5.3 Examples: Circular Linked List
- 6.1 Introduction to Doubly Linked List
- 6.2 Doubly Linked List Operations
- 6.3 Examples: Doubly Linked List
- 7.1 Stack
- 7.2 Queue
- 7.3 Fixed-size Queue
- 7.4 Circular Queue
- 7.5 Double Ended Queue (Deque)
- 8.1 Introduction to Hashing
- 8.2 Hashing Techniques
- 8.3 Hash Collision
- 8.4 Hash Collision Resolution
- 8.5 Hash Functions
- 8.6 Hashmap
- 8.7 Additional Topics
- 9.1 Introduction
- 9.2 Brute Force Method
- 9.3 Rabin-Karp String Matching Algorithm
- 9.4 Knuth-Morris-Pratt (KMP) Algorithm
- 10.1 Non-linear Data Structure
- 10.2 Tree Data Structure
- 10.3 Implementation of Trees
- 10.4 Tree Traversal
- 11.1 Introduction to Binary Trees
- 11.2 Properties of Binary Trees
- 11.3 Implementation of Binary Trees
- 11.4 Traversal of Binary Tree
- 11.5 Types of Binary Trees
- 11.6 Example: Huffman Coding
- 11.7 Example: Binary Search Tree
- 12.1 Array Representation of Binary Tree
- 12.2 Introduction to Heaps
- 12.3 Heap Operations
- 12.4 Heapify
- 12.5 Heap Sort
- 12.6 Heap as a Priority Queue
- 13.1 Graph Data Structure
- 13.2 Graph Terminologies
- 13.3 Adjacency Matrix
- 13.4 Adjacency List
- 13.5 Graph Traversal With DFS Algorithm
- 13.6 BFS Algorithm
- 14.1 Graph Connectivity
- 14.2 Touring a Graph
- 14.3 Graph Comparisons and Special Properties
- 14.4 Types of Graph
- 15.1 Graph Based Algorithms
- 15.2 Topological Sorting
- 15.3 Dijkstra's Algorithm
- 15.4 Bellman Ford's Algorithm
- 15.5 Ford Fulkerson Algorithm
- 15.6 Spanning Trees
- 15.7 Kruskal's Algorithm
- 15.8 Prim's Algorithm
- 16.1 Introduction to Greedy Algorithms
- 16.2 The Classroom Scheduling Problem
- 16.3 Coin Change Problem
- 16.4 The Fractional Knapsack Problem
- 16.5 1 Knapsack Problem
- 17.1 Additional Sorting Techniques
- 17.2 Bucket Sort
- 17.3 Radix Sort
- 17.4 Shell Sort
- 18.1 Introduction to Balanced Trees
- 18.2 AVL Trees
- 18.3 Red-Black Trees
- 19.1 B-Trees
- 19.2 B-Tree Operations
- 19.3 B+ Trees
- 19.4 Operations in B+ Trees
- 20.1 Introduction to Dynamic Programming
- 20.2 Fibonacci Series Using Dynamic Programming
- 20.3 The 0-1 Knapsack Problem
- 21.1 What's Next?
Python CERTIFICATION
Get Python certified
Get your skills verified with our certification.
Showcase your expertise on LinkedIn and stand out from the crowd. Impress your potential employers.
JOB OPPORTUNITY
COMING LATER THIS YEAR
Receive job opportunities from top companies
Upon completion of the learning path, you will receive job opportunities from top countries around the world.
Learn Python by Doing
Build hands-on projects that mirror real developer challenges. Apply what you learn immediately — so you can learn by doing, not just watching.

Looking to break into tech?
Landing your first job is difficult, but you don't have to figure it out alone.
Build real projects for your portfolio, earn certificates you can share, and follow a learning path that takes you from the basics to job-ready skills.
Courses similar to this
Frequently asked questions
You can start Learn DSA with Python with a 7-day free trial. Click "Enroll for FREE" to begin.
About 1 month. The course has 21 chapters.
Learn DSA with Python is an Advanced course. We recommend completing Getting started with Python, Go beyond Python fundamentals, Practice: Python Basics and Practice: Python Intermediate first.
Yes. Complete Learn DSA with Python to earn a Python certificate with your name on it, which you can download or share on LinkedIn. Certificates are included with your subscription.
Practice Problems: 95+
