Data Structures and Algorithms in Python

A beginner-friendly introduction to common data structures (linked lists, stacks, queues, graphs) and algorithms (search, sorting, recursion, dynamic programming) in Python. This course will help you prepare for coding interviews and assessments. Enroll now to start learning.

• Watch live hands-on coding-focused video tutorials
• Practice coding with cloud Jupyter notebooks
• Solve questions from real programming interviews
• Earn a verified certificate of accomplishment

The course is self-paced and there are no deadlines. There are no prerequisites for this course.

• Linear and Binary Search
• Complexity and Big O Notation
• Linked Lists using Python Classes

• Understand and solve a problem systematically
• Implement linear search and analyze it
• Optimize the solution using binary search

• Binary trees, traversals, and recursion
• Binary search trees & common operations
• Balanced binary trees and optimizations

• Hash tables from scratch in Python
• Handling collisions using linear probing
• Replicating Python dictionaries

• Bubble sort and Insertion Sort
• Merge sort using Divide & Conquer
• Quicksort and average complexity

• Implement polynomial multiplication
• Optimize using divide and conquer
• Analyze time and space complexity

• Recursion and memoization
• Subsequence and knapsack problems
• Backtracking and pruning

• Graphs, trees, and adjacency lists
• Breadth-first and depth-first search
• Shortest paths and directed graphs

• Pick an interesting coding problem
• Solve the problem step-by-step
• Document and present the solution

• Practice questions and solutions
• Tips for solving coding challenges
• Advice for cracking coding interviews