← Back to all courses
Course 08 of 10

Data Structures & Algorithms

LeetCode + Interview Prep
18 classes180+ LeetCode problemsNov 2026 · Ongoing08 Data-Structures-and-Algorithms

The interview course. Master every core data structure and algorithm pattern in Python, then prove it with 180+ LeetCode solutions and a dedicated interview-prep track.

How links work here: every class, project, notes, code and interview-prep link for this course opens the main course folder on GitHub — https://github.com/waleedkhokar/python-ai-engineering-journey/tree/main/08%20Data-Structures-and-Algorithms — so you always land in the right place, never on a guessed sub-folder.

What You Will Learn

Big OArrays & StringsLinked ListsStacks & QueuesHash TablesTrees & GraphsDynamic ProgrammingGreedyBacktrackingTries

All Classes

Every class in this course, in order — with exactly what each class teaches. Notes, code and interview prep for each class live in the course folder on GitHub.

00

Setup & Environment

Python for DSA, LeetCode setup, test runner.

01

Complexity Analysis

Big O, time and space complexity, amortized analysis.

02

Arrays & Strings

Two pointers, sliding window, prefix sum.

03

Linked Lists

Singly, doubly and circular lists, reversal, cycle detection.

04

Stacks & Queues

LIFO, FIFO, monotonic stack, deque.

05

Hash Tables

Hash maps, sets, collision handling, frequency counting.

06

Recursion

Base cases, the recursion tree, memoization.

07

Sorting Algorithms

Merge sort, quick sort, heap sort, counting sort.

08

Searching Algorithms

Binary search, binary search on the answer.

09

Trees

Binary trees, traversals (in-order, pre-order, post-order), BFS and DFS.

10

Binary Search Trees

Insert, delete, search, balanced trees.

11

Heaps & Priority Queues

Min-heap, max-heap, top-K problems, heapify.

12

Graphs

BFS, DFS, topological sort, shortest paths (Dijkstra).

13

Dynamic Programming

1D and 2D DP, knapsack, LCS, LIS.

14

Greedy Algorithms

Interval scheduling, activity selection.

15

Backtracking

N-Queens, permutations, subsets, combinations.

16

Tries

Prefix trees, autocomplete, word search.

17

Bit Manipulation

Bitwise operators, masks, XOR tricks.

99 — LeetCode Solutions

Solved problems from the course folder, grouped by difficulty.

50+
Easy

50+ problems solved and explained

Open Solutions
100+
Medium

100+ problems solved and explained

Open Solutions
30+
Hard

30+ problems solved and explained

Open Solutions

Interview Preparation

Every class in this course includes interview preparation. Open the course folder on GitHub for the full material.

Common Interview Questions

The questions interviewers actually ask on this course's topics, with clear, structured answers.

Open Interview Prep

Coding Challenges

Hands-on problems for each class, so you can prove the skill, not just describe it.

Open Interview Prep

Common Mistakes to Avoid

The errors beginners make with these topics — and how professionals avoid them.

Open Interview Prep

Best Practices

How working engineers write this code in production: clean, tested and maintainable.

Open Interview Prep
100 — Interview Prep: Company questions from Google, Amazon and Microsoft, the common patterns behind them (two pointers, sliding window and more), and printable cheat sheets. Open the interview prep folder.
← Previous Course
07 · Agentic AI Engineering