Course Introduction
Big O Notation
-
Section Introduction (1:43)
-
Complexity Analysis (5:25)
-
Why we need Big O Notation? (6:31)
-
Big O(n) Complexity (7:47)
-
Big O(1) Complexity (4:04)
-
Counting Operations (3:32)
-
Simplifying Big O - Part 1 (7:19)
-
Big O(n^2) Complexity (3:44)
-
Simplifying Big O - Part 2 (2:35)
-
Big O(n!) Complexity (1:25)
-
Space Complexity (4:39)
-
Space Complexity - II (1:44)
-
Section Summary (1:38)
Essential Concepts - I
Data Structure - Introduction
Data Structures - Array
Data Structures - Linked List
Data Structures - Stack and Queue
Data Structures - Hash Tables
Data Structures - Trees
Data Structures - Heaps
Data Structures - Trie
Data Structures - Graph
Essential Concepts - II
Algorithm: Searching
Algorithm: Sorting Elementary
-
Sorting Algorithm Introduction (2:20)
-
Bubble Sort (4:52)
-
Bubble Sort Visualization (2:25)
-
Bubble Sort Implementation (7:19)
-
Bubble Sort Complexity (3:32)
-
Selection Sort (4:11)
-
Selection Sort Visualization (3:21)
-
Selection Sort - Implementation (6:59)
-
Selection Sort - Complexity (2:32)
-
Insertion Sort (3:48)
-
Insertion Sort Implementation (7:43)
-
Insertion Sort Complexity (2:35)
-
Performance Analysis (4:07)
Algorithm: Sorting Advanced
Algorithms: Tree Traversal
-
Tree Traversal (18:52)
-
Depth First Search - Preorder Inorder Postorder (10:02)
-
Binary Tree Implementation (9:54)
-
Depth First Search - Implementation (20:42)
-
Depth First Search - Complexity (3:18)
-
Breadth First Search - Level Order (10:10)
-
Breadth First Search - Implementation (13:26)
-
Breadth First Search - Complexity (2:19)
Algorithms: Graph Traversal
Implementations and Interview Questions
IQ 1 - Two Sum
IQ 2 - Min Stack
IQ 3 - Max Stack
IQ 4 - Design a Linked List
IQ 5 - Reverse Linked List
IQ 6 - Construct Binary Tree
IQ 7 - Invert Binary Tree
IQ 8 - Construct Binary Search Tree
IQ 9 - Detect Capital
IQ 10 - Reverse String
IQ 11 - Longest Palindromic Substring
Thank You For Being Here!
Course Completion Certificate
