Skip to main content

#Graph Traversal

Browse articles tagged with #Graph Traversal

  • 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

    Number of Islands Problem Solution

    Complete Java implementation for counting connected land cells in a 2D grid using DFS and BFS approaches.

  • 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

    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 Patterns

    Number of Islands Problem Solution in Java

    Complete Java implementation for counting islands in a 2D grid using DFS and BFS approaches with time and space complexity analysis.

  • DSA Patterns

    Breadth-First Search Queue Patterns in Java

    Comprehensive guide to BFS queue patterns including level-order traversal, shortest path finding, and multi-source exploration with practical Java implementations.

  • DSA Patterns

    Detecting Cycles in Linked Lists and Graphs

    Comprehensive guide to cycle detection algorithms including Floyd's Tortoise and Hare, DFS-based approaches, and practical implementation strategies for FAANG interviews.

Stay in the Loop

Get curated DSA patterns, coding problems, frontend and backend LLD/HLD, and AI/ML System Design insights delivered straight to your inbox. No spam, just focused interview and engineering content.