Pass those difficult algorithms and data structures interview questions asked by the largest silicon valley companies. Even if you didn’t go to school for it, gain the advantages and skills a traditional computer science education can give you. We’ll tackle the big computer science concepts: Algorithms and Big O Analysis, Recursion, Sorting, Data Structures, AVL Trees, Binary Search Trees, Tree Traversals, and Path Finding.
Overview
Syllabus
- Introduction
- Code Setup
- Big O Time Complexity
- Why Use Big O
- Spatial Complexity
- Big O Trade-Offs
- Bubble Sort
- Bubble Sort Practice
- Insertion Sort
- Insertion Sort Practice
- Recursion
- Recursion Practice: Nested Addition
- Recursion Practice: Factorials
- Merge Sort
- Merge Sort Practice
- Merge Sort Q&A
- Quick Sort
- Quick Sort Practice
- Quick Sort Q&A
- Radix Sort
- Radix Sort Practice
- Binary Search
- Binary Search Practice
- ArrayList
- ArrayList Practice
- LinkedList
- LinkedList Practice
- Binary Search Tree
- Binary Search Tree Practice
- Self Balancing AVL Tree
- Self Balancing AVL Tree Exercise
- Self Balancing AVL Tree Solution
- AVL Trees Q&A
- Depth First Tree Traversals
- Depth First Tree Traversals Practice
- Breadth First Tree Traversals
- Breadth First Tree Traversals Practice
- Heap Sort
- Heap Sort Practice
- Graphs
- Graphs Practice
- Pathfinding
- Pathfinding Exercise
- Pathfinding Solution: a neighbors
- Pathfinding Solution: b neighbors
- Tries
- Tries Exercise
- Tries Solution
- Bloom Filters
- Bloom Practice
- Wrapping Up
Taught by
Brian Holt
