Skip to content

Coding Interview Preparation

Overview

Initializing search

Home
Phase 1 - Fundamentals
Phase 2 - Core Data Structures
Phase 3 - Trees (Foundation)
Phase 4 - Searching & Sorting
Phase 5 - Advanced Trees
Phase 6 - Graph Basics
Phase 7 - Advanced Algorithms (Coming Soon)
Part 5 - Practice Problems

Coding Interview Preparation

Home
Phase 1 - Fundamentals
Phase 1 - Fundamentals
- Overview
- Big O Notation
Phase 2 - Core Data Structures
Phase 2 - Core Data Structures
Phase 3 - Trees (Foundation)
Phase 3 - Trees (Foundation)
Phase 4 - Searching & Sorting
Phase 4 - Searching & Sorting
- Sorting Overview
- Simple Sorts (Bubble, Insertion)
- Efficient Sorts (Merge, Quick)
- String Search
  String Search
  - Boyer-Moore
  - Rabin-Karp
Phase 5 - Advanced Trees
Phase 5 - Advanced Trees
Phase 6 - Graph Basics
Phase 6 - Graph Basics
- Graph Traversal (BFS/DFS)
- BFS Theory
Phase 7 - Advanced Algorithms (Coming Soon)
Phase 7 - Advanced Algorithms (Coming Soon)
- None
Part 5 - Practice Problems
Part 5 - Practice Problems
- Overview
- Dynamic Programming
  Dynamic Programming
- Arrays
  Arrays
- Binary Search Trees
  Binary Search Trees
  - Overview Overview
    Table of contents
    
    Problems
  - Bst Construction
  - Bst Traversal
  - Find Closest Value In Bst
  - Same Bsts
  - Validate Bst
- Binary Trees
  Binary Trees
- Famous Algorithms
  Famous Algorithms
- Graphs
  Graphs
- Heaps
  Heaps
- Linked Lists
  Linked Lists
- Recursion
  Recursion
- Searching
  Searching
- Sorting
  Sorting
- Stacks
  Stacks
- Strings
  Strings
- Tries
  Tries

Binary Search Trees

Total Problems: 5

```

Problems

Bst Construction
Bst Traversal
Find Closest Value In Bst
Same Bsts
Validate Bst

Made with Material for MkDocs