Solved DFS-1

[Dheepthi-Reddy]

• Solved Flood Fill
• Solved 01 Matrix

[super30admin]

• FloodFill.py: Your solution is well-implemented and correctly solves the problem. The use of DFS is appropriate here, and your comments are clear and helpful. Good job!
• LeetCode_01_matrix.py: Your approach to solving this problem is incorrect. DFS is not the right choice for this problem because it does not efficiently compute the nearest 0 for each cell. Consider using BFS instead, starting from all 0s and propagating the distances outward. This approach would be more efficient and correct. Additionally, your comments could be more detailed to explain the logic better.