📄️ DFS on Matrix
This technique uses recursion to traverse a matrix (or 2D array) 4-directionally in a depth-first search manner.
📄️ DFS on Undirected Graph
This technique traverses an undirected graph in a depth-first search manner.
📄️ Topological Sort
This technique is used for finding a linear ordering of elements that have dependencies on each other.