Biweekly Leetcode Contest 77 | 6054. Escape the Spreading Fire

Contest Link - leetcode.com/contest/biweekly...
Problem Link - leetcode.com/contest/biweekly...
Code - leetcode.com/contest/biweekly...
*********************************************************************
Interview Experiences Playlists -
Microsoft - • Microsoft Interview Qu...
Amazon - • Amazon Interview Quest...
D.E.Shaw - • D.E.Shaw Interview Que...
Linkedin - • Linkedin Interview Que...
Facebook - • Facebook (Meta) Interv...
*********************************************************************
Please show support and subscribe if you find the content useful.

[@Ani_86_]

I never went away disappointed after watching your videos... I always got the right intuition and concept behind every problem explanation video of yours..

[@ujjwalagnihotri5001]

While implementing the check function for binary search , I got WA with DFS and AC with BFS, what could be the reason ? The below DFS function which gives WA private boolean dfs(int mid, int[][] dp, int[][] grid, int r, int c, int n, int m, boolean[][] visited) { if (r == n - 1 && c == m - 1) { return true; } boolean res = false; for (int i = 0; i < 4; ++i) { int nr = r + dx[i], nc = c + dy[i]; if (nr >= 0 && nc >= 0 && nr < n && nc < m && !visited[nr][nc] && grid[nr][nc] != 2) { visited[nr][nc] = true; if (mid + 1 < dp[nr][nc]) { res = res || dfs(mid + 1, dp, grid, nr, nc, n, m, visited); } } } return res; }

[@hoyinli7462]

thx for your video, mate! :)

[@codingmohan]

Glad you find it helpful :) Do share it with your friends so that maximum people can get benefitted from it.

[@techyguy7776]

Great explanation man...but could you switch to Hindi whenever it is little tricky to explain some parts

[@codingmohan]

Thanks for the feedback. I tried keeping it in English because I see some US viewers as well, but I can definitely do otherwise if explanations are not clear. If possible can you please pin-point the exact timestamp from where you start feeling that a Hindi explanation could have been better?

[@gladyouseen8160]

@@codingmohan so T.C is O(m*n log(mn))?

[@codingmohan]

@@gladyouseen8160 Yes. But it is O(m*n*log(MAX_STEPS)), where in this case, MAX_STEPS is 10^9.