11 docs tagged with "DFS"

This is a solution to the 2096. Step-By-Step Directions From a Binary Tree Node to Another problem on LeetCode.

This is a solution to the 785. Is Graph Bipartite? problem on LeetCode.

This is a solution to the All Elements in Two Binary Search Trees.

This is a solution to the Binary Tree Preorder Traversal problem on LeetCode.

This is a solution to the Binary-Tree-Postorder-Traversal problem on LeetCode.

This is a solution to the Cheapest Flights Within K Stops problem on LeetCode.

This is a solution to the Deepest Leaves Sum problem on LeetCode.

This tutorial covers the solution to the DFS of Graph problem from the GeeksforGeeks website, featuring implementations in C++.

Calculate the m x n grid result, where result[i][j] is the average intensity of the regions to which image[i][j] belongs, rounded down to the nearest integer.

This is a solution to the Two Sum problem on LeetCode.

Find the number of unique paths from the starting square to the ending square in a grid, walking over every non-obstacle square exactly once.