Algo Monster

Combinatorial search problems involve finding grouping and assignments of objects that satisfy certain conditions. Finding all permutations/subsets, solving sudoku, and 8-queens are classic combinatorial problems.

We have an array and a sliding window defined by a start index and an end index. The sliding window moves from left of the array to right. There are always k elements in the window. The window moves one position at a time. https://bit.ly/3hvcg7Z

Trees are special graphs that have no cycle. We can still use DFS in #graphs with cycles. We just have to record nodes we have visited and avoiding re-visiting them and going into an infinite #loop. https://algo.monster

With a solid understanding of recursion under our belt, we are now ready to tackle one of the most useful techniques in #coding_interviews - #Depth_First_Search ( #DFS ). https://bit.ly/32vgCaW