×

# Require problems on DFS

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.

Note by Lokesh Sharma
3 years, 8 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

A $$2 \times 2$$ Rubik's Cube can be solved with DFS but I guess the right solution is BFS. Try an implementation of both.

- 3 years, 8 months ago

If you want official problems,there should be some in this topcoder tutorial.

- 3 years, 8 months ago