Data Structures and Algorithms – Complete Course

Course Curriculum

Chapter 1: Introduction

Lecture 1: Course Overview

Lecture 2: What are data structures and algorithms?

Chapter 2: Analysis of Algorithms

Lecture 1: Analysis of Algorithms – Running Time

Lecture 2: Asymptotic Analysis of Algorithms

Lecture 3: Big O notation

Lecture 4: Big Omega notation

Lecture 5: Big Theta Notation

Chapter 3: Arrays

Lecture 1: Arrays – Introduction

Lecture 2: Arrays in C++, Java, Python

Lecture 3: Exercise: Build Array from Permutation

Lecture 4: Exercise: Concatenation of Array

Lecture 5: Running Sum of 1d Array

Lecture 6: Dynamic Arrays – Introduction

Lecture 7: 2D Arrays

Chapter 4: Linked Lists

Lecture 1: Linked List – Introduction

Lecture 2: Linked List – Advantages and Disadvantages

Lecture 3: Linked List – Representation and Traversal

Lecture 4: Linked List – Insertion cases and Code

Lecture 5: Linked List – Deletion

Lecture 6: Linked List – Search a key

Lecture 7: Find Kth Node from end of a Linked List

Lecture 8: Find Middle of a Linked List

Lecture 9: Detect Loop in Linked List

Lecture 10: Why Floyd's Cycle detection works?

Lecture 11: Find the beginning of Loop in Linked List

Chapter 5: Trees

Lecture 1: Trees – Introduction

Lecture 2: Binary Trees – Representation

Lecture 3: Simple Binary Tree in C++

Lecture 4: Properties of Binary Tree

Lecture 5: Types of Binary Tree

Lecture 6: Insertion in Binary Tree – Level Order Insertion

Lecture 7: Deletion in Binary Tree – in single traversal

Lecture 8: Tree Traversals – Inorder, Preorder, Postorder, Level Order

Lecture 9: Range sum of a Binary Search Tree

Lecture 10: Path Sum of Binary Tree

Lecture 11: Exercise – Two Sum in Binary Search Tree

Chapter 6: Stacks and Queues

Lecture 1: Stack data strcuture

Lecture 2: Queue data structure

Lecture 3: Stacks – C++ STL

Lecture 4: Queue – C++ STL

Lecture 5: Inorder traversal of Binary Tree without recursion

Chapter 7: Graphs

Lecture 1: Graphs – Introduction

Lecture 2: Graph Representation

Lecture 3: Breadth First Search – Graph Traversal

Lecture 4: Depth First Search – Graph Traversal

Lecture 5: Applications of DFS and BFS

Lecture 6: Iterative DFS

Lecture 7: Pre and Post visited times in DFS

Lecture 8: DFS – Types of Edges

Lecture 9: Cycle Detection in Directed Graph

Lecture 10: Cycle Detection in Undirected Graph

Lecture 11: Disjoint Set (Union-Find) Algorithm – Introduction

Chapter 8: Heaps

Lecture 1: Binary Heap – Introduction

Lecture 2: Binary Heap – Representation

Lecture 3: Binary Heap Implementation

Lecture 4: Build Heap and its Time Complexity

Lecture 5: Merge k sorted linked lists

Chapter 9: Hash Table

Lecture 1: Hash Table – Introduction

Lecture 2: Hash Table – Principle

Lecture 3: Designing a Hash Table

Lecture 4: Design a Hash Set – Explanation and solution

Lecture 5: Design a Hash Map

Lecture 6: Using Hash Set in C++, Java and Python

Lecture 7: Complexity Analysis of Hash Tables

Chapter 10: Recursion

Lecture 1: Mastering Recursion for Programming Interviews

Lecture 2: Sum of left leaves of Binary Tree

Chapter 11: Conclusion

Lecture 1: Conclusion and Thank you