1
00:00:01,120 --> 00:00:04,150
The plan of attack is quite simple for this one.

2
00:00:04,900 --> 00:00:10,960
If we are tasked with finding the shortest spot, we find it using Destroyer and stop.

3
00:00:12,380 --> 00:00:17,390
And if not, then we performed the recursive implementation of the DFS.