# Category: Depth First Search

## Teaching Kids Programming – Count Nodes Equal to Sum of Descendants (Recursive Depth First Search Algorithm)

Teaching Kids Programming: Videos on Data Structures and Algorithms Given the root of a binary tree, return the number of nodes where the value of the node is equal …

## Teaching Kids Programming – Check if There is a Path With Equal Number of 0’s And 1’s (Maze, Recursion, Memoization, Dynamic Programming)

Teaching Kids Programming: Videos on Data Structures and Algorithms You are given a 0-indexed m x n binary matrix grid. You can move from a cell (row, col) to …

## Teaching Kids Programming – Finding 3-Digit Even Numbers (Recursive Depth First Search Algorithm)

Teaching Kids Programming: Videos on Data Structures and Algorithms You are given an integer array digits, where each element is a digit. The array may contain duplicates. You need …

## Teaching Kids Programming – Nearest Exit from Entrance in Maze via Iterative Deepening Search Algorithm (IDS)

Teaching Kids Programming: Videos on Data Structures and Algorithms You are given an m x n matrix maze (0-indexed) with empty cells (represented as ‘.’) and walls (represented as …

## Teaching Kids Programming – Nearest Exit from Entrance in Maze via Depth First Search Algorithm (DFS)

Teaching Kids Programming: Videos on Data Structures and Algorithms You are given an m x n matrix maze (0-indexed) with empty cells (represented as ‘.’) and walls (represented as …