Explaining Leetcode -

Опубликовано: 01 Апрель 2026
на канале: JTECH
285
1

In this video I explain the algorithm behind solving Leetcode problem 2101 Detonate the Maximum Bombs. I first solve the problem using a detailed Depth first search (DFS) algorithm. It can be understood by newbies and by those who haven't done graph traversal previously. This approach is relatively slow so I mold it to keep the same logic while performing less operations.

I explained things relatively slowly in this video and it can be safely watched at 2x.

00:00 Introduction + understanding the problem
03:01 Explaining the basic DFS solution
17:55 Explaining the refined DFS solution: Translating the input into a typical graph problem then performing DFS