- DSA Problems
Flood Fill Algorithm Implementation and Analysis
Complete Java solution for flood fill algorithm with BFS/DFS approaches, time complexity analysis, and practical implementation considerations for FAANG interviews.
- DSA Problems
Max Area of Island Java Solution
Complete Java implementation for finding maximum area of island in 2D grid using DFS and BFS approaches with time and space complexity analysis.
- DSA Problems
Rotting Oranges Java Solution with BFS
Complete Java implementation of the rotting oranges problem using breadth-first search to find minimum time for all oranges to rot.
- DSA Problems
Pacific Atlantic Water Flow Problem Solution
Complete Java implementation for finding cells where water can flow to both Pacific and Atlantic oceans in a grid.
- DSA Problems
Clone Graph Problem Solution | Graph Traversal and Deep Copy
Complete Java solution for cloning a connected undirected graph with BFS/DFS approaches, handling node duplication and adjacency mapping.
- DSA Problems
Number of Islands Problem Solution
Complete Java implementation for counting connected land cells in a 2D grid using DFS and BFS approaches.
- DSA Patterns
Connected Components in Graphs and Grids
Complete guide to finding connected components using Union-Find, DFS, and BFS approaches with Java implementations for FAANG interviews.
- DSA Patterns
Dijkstra's Algorithm and BFS for Shortest Path Problems
Comprehensive guide to implementing Dijkstra's algorithm and BFS for finding shortest paths in weighted and unweighted graphs, with practical Java solutions and performance considerations.
- DSA Patterns
Topological Sort Algorithm Implementation and Applications
Complete Java solution for topological sorting with DFS and BFS approaches, including cycle detection and practical use cases.
- DSA Problems
Subtree of Another Tree Java Solution
Complete Java implementation for checking if one binary tree is a subtree of another, including multiple approaches and time complexity analysis.
- DSA Patterns
Clone Graph - Deep Copy of Connected Undirected Graph
Comprehensive Java solution for cloning connected undirected graphs with DFS and BFS approaches, including time/space complexity analysis and implementation trade-offs.
- DSA Problems
Same Tree and Symmetric Tree Problems in Java
Comprehensive Java solution for same tree and symmetric tree problems including recursive and iterative approaches with time and space complexity analysis.
#BFS
Browse articles tagged with #BFS