Completed
⌨️ Heap and Trie
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Master Technical Interviews – Full Course
Automatically move to the next video in the Classroom when playback concludes
- 1 ⌨️ Introduction
- 2 ⌨️ Types of Interviews
- 3 ⌨️ Introduction to Big O
- 4 ⌨️ Types of Data Structures
- 5 ⌨️ Arrays
- 6 ⌨️ Linked List
- 7 ⌨️ Stack
- 8 ⌨️ Queue
- 9 ⌨️ Trees
- 10 ⌨️ Graphs
- 11 ⌨️ Hashmap and Hashset
- 12 ⌨️ Heap and Trie
- 13 ⌨️ Algorithms with Coding Patterns
- 14 ⌨️ Searching Algorithms
- 15 ⌨️ Sorting Algorithms
- 16 ⌨️ Recursion
- 17 ⌨️ Dynamic Programming
- 18 ⌨️ Sliding Window
- 19 ⌨️ Two Pointer
- 20 ⌨️ Fast and Slow Pointer
- 21 ⌨️ Backtracking
- 22 ⌨️ Intervals
- 23 ⌨️ Breadth First Search
- 24 ⌨️ Depth First Search
- 25 ⌨️ Greedy Algorithms
- 26 ⌨️ Golden Rules for Technical Interviews
- 27 ⌨️ Mistakes to avoid
- 28 ⌨️ Preparation resources
