Welcome to a super fun, beginner-friendly data structures and algorithms course. Is it really the last algorithms course you'll need? If you want to pass tough interview questions, then yes! You'll learn big o time complexity, fundamental data structures like arrays, lists, trees, graphs, and maps, and searching and sorting algorithms.
ThePrimeagen
Netflix
The Last Algorithms Course You'll Need
- Binary search
- Binary tree comparison
- Breadth-first search - Binary tree
- Breadth-first search - Graph list
- Breadth-first search - Graph matrix
- Bubble sort
- Depth-first search - Binary search tree
- Depth-first search - Graph list
- Dijkstra's shortest path
- Doubly linked list
- Insertion sort
- Linear search
- LRU
- Map
- Maze solver
- Merge sort
- Min heap
- Prim's algorithm
- Queue
- Quick sort
- Ring buffer
- Singly link list
- Stack
- Tree traversal (pre, post and in order)
- Trie
- Two crystall balls