Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Data Structures & Algorithms
Data Structures & Algorithms
Intro (0:36)
What is an algorithm (0:39)
Time Complexity and Big O (4:33)
Your reward awaits
Big O linear and constant (3:00)
Cubic time (1:26)
Big O terms (0:19)
Logarithmic time (1:47)
Recap time complexity (1:56)
Space complexity (3:12)
Space Optimization (1:29)
Data Structures (1:17)
Arrays (8:13)
Linked Lists (3:41)
Linked List Operations (3:54)
Stack (3:54)
Queues (1:58)
Trees (5:12)
Binary Trees (3:12)
Height Balanced Trees (1:20)
Height Balanced Trees Fix (1:18)
AVL Trees (1:05)
Red-Black Trees (0:34)
Min Heap (1:15)
Max Heap (0:24)
N-Ary Trees (0:50)
Tries (2:53)
Graphs (5:51)
Graphs Time Complexity (1:09)
Graph Terminology (1:32)
Searching Algorithms - Linear Search vs Binary Search (4:40)
Binary Search (2:16)
Recursion (2:00)
Sorting a collection (1:18)
Selection Sort (1:58)
Insertion Sort (3:01)
Quick Sort (4:35)
Quick Sort efficency (2:27)
Merge Sort Explained (4:03)
Merge Sort efficency (3:08)
Hashtables (5:14)
Hash functions (1:54)
Hashtable conclusion (1:58)
Outro (1:32)
Bonus - Tech Interview Prep (7:31)
Tries
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock