Skip to content
Coding Interview Preparation
BFS Theory
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
Arrays & Basics
Linked Lists
Stacks & Queues
Hash Tables
Phase 3 - Trees (Foundation)
Phase 3 - Trees (Foundation)
Binary Search Trees
Heaps
Trie & TST
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
AVL Trees
Red-Black Trees
Splay Trees
B-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
Overview
Disk Stacking
Knapsack Problem
Levenshtein Distance
Longest Common Subsequence
Longest Increasing Subsequence
Longest String Chain
Max Profit With K Transactions
Max Subset Sum No Adjacent
Max Sum Increasing Subsequence
Min Number Of Coins For Change
Min Number Of Jumps
Number Of Ways To Make Change
Numbers In Pi
Palindrome Partitioning Min Cuts
Water Area
Arrays
Arrays
Overview
Apartment Hunting
Calendar Matching
Four Number Sum
Largest Range
Longest Peak
Min Rewards
Monotonous Array
Move Element To End
Smallest Difference
Spiral Traverse
Subarray Sort
Three Number Sum
Two Number Sum
Zigzag Traverse
Binary Search Trees
Binary Search Trees
Overview
Bst Construction
Bst Traversal
Find Closest Value In Bst
Same Bsts
Validate Bst
Binary Trees
Binary Trees
Overview
Branch Sums
Flatten Binary Tree
Invert Binary Tree
Iterative In-Order Traversal
Max Path Sum In Binary Tree
Right Sibling Tree
Famous Algorithms
Famous Algorithms
Overview
Kadanes Algorithm
Knuth Morris Pratt Algorithm
Topological Sort
Graphs
Graphs
Overview
Airport Connections
Boggle Board
Breadth First Search
Depth First Search
Rectangle Mania
River Sizes
Single Cycle Check
Youngest Common Ancestor
Heaps
Heaps
Overview
Continuous Median
Min Heap Construction
Linked Lists
Linked Lists
Overview
Find Loop
Linked List Construction
Lru Cache
Merge Linked Lists
Remove Kth Node From End
Reverse Linked List
Recursion
Recursion
Overview
Interweaving Strings
Lowest Common Manager
Nth Fibonacci
Number Of Binary Tree Topologies
Permutations
Powerset
Product Sum
Searching
Searching
Overview
Binary Search
Find Three Largest Numbers
Quickselect
Search For Range
Search In Sorted Matrix
Shifted Binary Search
Sorting
Sorting
Overview
Bubble Sort
Heap Sort
Insertion Sort
Merge Sort
Quick Sort
Selection Sort
Stacks
Stacks
Overview
Balanced Brackets
Min Max Stack Construction
Strings
Strings
Overview
Caesar Cipher Encryptor
Group Anagrams
Longest Palindromic Substring
Longest Substring Without Duplication
Palindrome Check
Pattern Matcher
Smallest Substring Containing
Underscorify Substring
Tries
Tries
Overview
Multi String Search
Suffix Trie Construction
Bfstheory
This section explains the concept, its importance, and when to use it.
Bfstheory