01 Matrix (LeetCode 542) | Solution using BFS and Dynamic Programming | 2 sweeps simplified

preview_player
Показать описание


Chapters:
00:00 - Intro
00:39 - Problem Statement
03:20 - A better test case
05:47 - Solution using BFS
11:27 - Dynamic Programming Solution
18:55 - Dry run of Code
20:31 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
  1. Nikhil Lohia
  2. programming
  3. tutorial
  4. education
  5. algorithm
  6. logic
Рекомендации по теме
01 Matrix (LeetCode 0:21:27

01 Matrix (LeetCode 542) | Solution using BFS and Dynamic Programming | 2 sweeps simplified

Amazon Coding Interview 0:07:55

Amazon Coding Interview Question - 0 1 Matrix - LeetCode 542

01 Matrix - 0:07:49

01 Matrix - Leetcode 542 - Python

G-13. Distance of 0:20:21

G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java

01 Matrix - 0:11:50

01 Matrix - LeetCode #542 | Python, JavaScript, Java and C++

01 Matrix | 0:18:59

01 Matrix | Detailed Dry Run | Why BFS from 0s | GOOGLE | Leetcode - 542

01 Matrix - 0:18:07

01 Matrix - LeetCode 542 - Python #leetcode #bfs

01 Matrix - 0:18:09

01 Matrix - LeetCode 542 - Python - BFS

Leetcode 542 01 0:06:18

Leetcode 542 01 Matrix

01 Matrix - 0:14:55

01 Matrix - Leetcode 542 - Python | Amazon interview question

Leetcode 542. 01 0:10:25

Leetcode 542. 01 Matrix - Python

LEETCODE 542 01 0:11:22

LEETCODE 542 01 MATRIX PYTHON | BFS google interview question

LeetCode Problem 542: 0:45:09

LeetCode Problem 542: 01 Matrix in Java - FAANG Coding Interview - Blind 75 Question

Leetcode 542. 01 0:12:10

Leetcode 542. 01 Matrix [Java] Coding interview question

LeetCode 542. 01 0:16:55

LeetCode 542. 01 Matrix

01 Matrix Leetcode 0:20:02

01 Matrix Leetcode July Daily Challenge || Intuition + Code + Explanation

542 01 Matrix 0:10:55

542 01 Matrix Leetcode | Graph | Leetcode 542 01 Matrix | 01 Matrix

LeetCode - 542. 0:15:18

LeetCode - 542. 01 Matrix | BFS | Python | Java

Mastering LeetCode 542 0:07:44

Mastering LeetCode 542 - 01 Matrix Challenge in Python 🐍 | BFS Deep Dive + Multi-Language Solutions...

542. 01 Matrix 0:21:50

542. 01 Matrix - BFS - LeetCode - JavaScript

01 Matrix - 0:16:00

01 Matrix - Leetcode 542 - Python

Leetcode 542 | 0:07:17

Leetcode 542 | 01 Matrix

01 Matrix | 0:09:31

01 Matrix | Leetcode 542 | Live coding session

01 Matrix - 0:10:17

01 Matrix - Breadth First Search - Python - Leetcode 542

Комментарии
Автор

Wow Man you deserve a million likes. Wonderful explanation. I was able to understand a dp question in just a single video

zubairzafar
Автор

Use res[i][j] = 10000; when initializing the result array if you can't submit it on LeetCode due to overflow issues.

rashwanth
Автор

Please continue system design, lld part

nikhil_squats
Автор

The dp approach was so interesting to watch. Is it fair to say that this iterative approach is a way of simulating breadth-first search without the need for a queue?

matthewzarate
Автор

Brother ur doing great. Keep on going like this Bro. Also learn some youtube tricks to accelerate and it will sum up like a bamboo tree getting its massive form after a long wait.

DASARIPOOJITHA-cuov
Автор

sir explanation and all is very good but explaining and writing dry code its really tough from ur videos..make it simpler code use the fundamental concepts..when ur writing code

yashuj
join shbcf.ru