Can someone please suggest some Computer Science problems requiring implementation of Depth First Search. I wish to master Depth First Search implementation so that I can complete hard problems based on it.
I tried searching for some problems on Google Code Jam but right now it's hard for me to figure which problems are to be solved with DFS.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
A 2×2 Rubik's Cube can be solved with DFS but I guess the right solution is BFS. Try an implementation of both.
Log in to reply
If you want official problems,there should be some in this topcoder tutorial.