--- title: "#depth-first-search articles | Hashnode" description: "Explore 21 articles tagged #depth-first-search on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/depth-first-search" --- Tag # #depth-first-search 21 posts · 1 followers [Muppidi Srinivas](https://hashnode.com/@srinivas364) · [Mar 16](https://hashnode.com/posts/understanding-graphs-recursion-and-depth-first-search-dfs/69b7c6bb6ca8e7d49b9bc29f) ### [Understanding Graphs, Recursion, and Depth First Search (DFS)](https://srinivastechblog.hashnode.dev/understanding-graphs-recursion-and-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) Discover how recursion helps DFS explore graphs deeply and efficiently. 10 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/understanding-graphs-recursion-and-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) [Junghun Kim](https://hashnode.com/@vienna453) · [Jan 6](https://hashnode.com/posts/dfs-bfs-preorder-inorder-postorder/695cf3f06f0d1c80a6a36706) ### [DFS와 BFS, 그리고 Preorder / Inorder / Postorder의 진짜 관계](https://devnote-vienna453.hashnode.dev/dfs-bfs-preorder-inorder-postorder?utm_source=hashnode&utm_medium=feed) DFS와 BFS의 차이와 관계, 각 탐색 전략의 실무 활용 사례를 설명합니다. DFS의 순회 방식, BFS의 특징 등을 다룹니다 4 min read · [devnote-vienna453.hashnode.dev](https://devnote-vienna453.hashnode.dev/dfs-bfs-preorder-inorder-postorder?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 15, 2025](https://hashnode.com/posts/leetcode-695-max-area-of-island-dfs-med-java-om-n/687624f20e5c600feb8c78e6) ### [LeetCode 695 Max Area of Island - DFS (Med, Java, O(m × n))](https://huanganni.hashnode.dev/leetcode-695-max-area-of-island-dfs-med-java-om-n?utm_source=hashnode&utm_medium=feed) Problem Statement 695. Max Area of Island Given an m x n binary matrix grid, find the maximum area of an island. An island is a group of 1's connected 4-directionally (horizontal or vertical). The area of an island is the count of 1 cells in that i... 4 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-695-max-area-of-island-dfs-med-java-om-n?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 15, 2025](https://hashnode.com/posts/can-we-always-change-bfs-solution-to-dfs-solution/6875b0eb1227c3bb3de604d9) ### [Can we always change BFS solution to DFS solution?](https://huanganni.hashnode.dev/can-we-always-change-bfs-solution-to-dfs-solution?utm_source=hashnode&utm_medium=feed) There are some scenarios which you must use BFS or DFS 6 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/can-we-always-change-bfs-solution-to-dfs-solution?utm_source=hashnode&utm_medium=feed) [Michael Peattie](https://hashnode.com/@physics2comp) · [Jun 20, 2025](https://hashnode.com/posts/depth-first-search-dfs/6854e2d97b7d574480c4b144) ### [Depth First Search (DFS)](https://learncodedaily.hashnode.dev/depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) In a Nutshell Typically used on graphs or trees represented as adjacency lists or hash maps. Explores a tree/graph data structure as deep as possible before backtracking. Useful when you want to check if a path exists, not necessarily the shortest... 4 min read · [learncodedaily.hashnode.dev](https://learncodedaily.hashnode.dev/depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) [Tennis Kumar C](https://hashnode.com/@tenniskumarreddy) · [Mar 24, 2025](https://hashnode.com/posts/progress-review-for-days-21-and-22-and-strategic-devops-roadmap-planning/67e154c7f913f103f0ce26c2) ### [Progress Review for Days 21 & 22 and Strategic DevOps Roadmap Planning](https://leetcode-journey.hashnode.dev/progress-review-for-days-21-and-22-and-strategic-devops-roadmap-planning?utm_source=hashnode&utm_medium=feed) Explore binary tree challenges, enjoy a restful break, and dive into a strategic DevOps roadmap on infrastructure, CI/CD, and cloud services 2 min read · [leetcode-journey.hashnode.dev](https://leetcode-journey.hashnode.dev/progress-review-for-days-21-and-22-and-strategic-devops-roadmap-planning?utm_source=hashnode&utm_medium=feed) [Kumar Spandan Pattanayak](https://hashnode.com/@5p7Ro0t) · [Dec 21, 2024](https://hashnode.com/posts/leetcode-2872/6766bf740e04aa9dc410ba29) ### [Solving Leetcode 2872: Find the Maximum K-Divisible Components](https://5p7ro0t.hashnode.dev/leetcode-2872?utm_source=hashnode&utm_medium=feed) Leetcode Question Link: https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/ Intuition Initially, I thought of approaching it with array and tree traversal but didn't think of any other method. I got struck on how to pr... 2 min read · [5p7ro0t.hashnode.dev](https://5p7ro0t.hashnode.dev/leetcode-2872?utm_source=hashnode&utm_medium=feed) [Pawan Gangwani](https://hashnode.com/@pgangwani) · [Nov 11, 2024](https://hashnode.com/posts/crafting-graphs-in-typescript-a-comprehensive-guide-to-building-and-traversing-data-structures/67350ddd049e22009ef2e70e) ### [Crafting Graphs in TypeScript: A Comprehensive Guide to Building and Traversing Data Structures](https://blogs.pgangwani.co.in/crafting-graphs-in-typescript-a-comprehensive-guide-to-building-and-traversing-data-structures?utm_source=hashnode&utm_medium=feed) Learn how to build and traverse graph data structures using TypeScript, including vertices, edges, DFS, and BFS methods in this comprehensive guide 5 min read · [blogs.pgangwani.co.in](https://blogs.pgangwani.co.in/crafting-graphs-in-typescript-a-comprehensive-guide-to-building-and-traversing-data-structures?utm_source=hashnode&utm_medium=feed) [Chetan Datta](https://hashnode.com/@chetan77) · [Oct 27, 2024](https://hashnode.com/posts/diameter-of-binary-tree/671dc4fc8b6b3efc64cbb928) ### [Diameter of Binary Tree](https://chetan77.hashnode.dev/diameter-of-binary-tree?utm_source=hashnode&utm_medium=feed) Problem Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a p... 2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/diameter-of-binary-tree?utm_source=hashnode&utm_medium=feed) [Michael Stromberg](https://hashnode.com/@mjstromberg) · [Oct 19, 2024](https://hashnode.com/posts/solving-the-number-of-islands-problem-in-javascript/67142a7a9a1d6a97fddd6799) ### [Solving the “Number of Islands” Problem in JavaScript](https://mjstromberg.hashnode.dev/solving-the-number-of-islands-problem-in-javascript?utm_source=hashnode&utm_medium=feed) Photo by Cyrus Crossan on Unsplash Algorithmic problem-solving is central to coding interviews, especially for software engineering roles at major tech companies like Google, Facebook, and Amazon. While these challenges might not fully reflect day-to... 10 min read · [mjstromberg.hashnode.dev](https://mjstromberg.hashnode.dev/solving-the-number-of-islands-problem-in-javascript?utm_source=hashnode&utm_medium=feed)