Тёмный

G-07 BFS Problem Type-2 II BFS on Matrix II Shortest Path in Binary Matrix || Leetcode - 1091 

Aryan Mittal
Подписаться 47 тыс.
Просмотров 2,4 тыс.
50% 1

In this video, I'll talk about how to solve the problem - 1091. Shortest Path in Binary Matrix - It is one of the best BFS on Matrix problem, which will teach you about 8 directionally connected graph
Graph Practice Problem List by Aryan: drive.google.c...
Problem Link: leetcode.com/p...
C++/Java Code & Notes: drive.google.c...
Complete BAAP Graph Series: • Baap Graph Series - by...
Graph Problem Solving Playlist: • Complete Graph Intuiti...
G-07 BFS Problem Type-2 II BFS on Matrix II Shortest Path in Binary Matrix || Leetcode - 1091
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / aryan_mittal_007
📱Telegram : t.me/aryan_mit...
🤖 Github: github.com/ary...
Resources you can try:
Learn Coding: • Video
🎥Channel Playlists
Dynamic Programming: • Complete Dynamic Progr...
Bit Manipulation: • Complete BIT MANIPULAT...
Mathematics for DSA: • Complete Mathematics f...
Leetcode Top Interview Questions: • Leetcode Interview Que...
Codeforces Problem B Ladder: • Complete PROBLEM B LAD...
Codeforces Problem C Ladder: • Codeforces PROBLEM C L...
Codeforces Problem D Ladder: • Complete PROBLEM D LAD...
About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.
About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

Опубликовано:

 

6 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 8   
@muleyshubham
@muleyshubham Год назад
This is going to be great series! I'm learning from it. Keep uploading Aryan❤
@educationalpurpose4172
@educationalpurpose4172 Год назад
Really nice explanation
@167-saiteja7
@167-saiteja7 Год назад
but why can't we make a dp solution of 8 directions. In the dp example you mentioned there are only 3 directions.
@khushal7363
@khushal7363 3 месяца назад
it will cause any infinity recersive call if it can move above. you have to make a visited in dp then it may work but it will make it more complicated
@saahilkapoor2385
@saahilkapoor2385 Месяц назад
did it , gave tle on 68 test case
@Darkmatterkun
@Darkmatterkun Год назад
I don't know why this only has 335 views. I thought it would have 100k views atleast.
@saibhagyaramnidra8006
@saibhagyaramnidra8006 Год назад
So i think we need to include if(!vis[m-1][n-1]) return -1; Before return ans+1;
@saibhagyaramnidra8006
@saibhagyaramnidra8006 Год назад
It's not working for some test cases
Далее
Mcdonalds cups and ball trick 🤯🥤 #shorts
00:25
Просмотров 1,3 млн
G-36. Shortest Distance in a Binary Maze
23:42
Просмотров 146 тыс.
LeetCode was HARD until I Learned these 15 Patterns
13:00
Breadth First Search grid shortest path | Graph Theory
16:51
G-37. Path With Minimum Effort
24:30
Просмотров 139 тыс.