Multi source BFS Traversal - ua-cam.com/video/vIRIWTQwguM/v-deo.html BFS Traversal - ua-cam.com/video/kmBJ7IJR_pQ/v-deo.html Binary Search Template - ua-cam.com/video/UZx_DI4z_l8/v-deo.html . 3 DSA Mistakes you should never do - ua-cam.com/video/E1x8SEFDKA0/v-deo.html
DID it finally thankyou very much. aapke vid se maine voh multiple bfs ke baare me hint liya aur binary search ka concept use kiya ! ab but dar lag rha hai ki sach me ache se kiya ya bas ratta maar liya jaise aapke 3 mistakes wale vid me aapne bataya tha. baad me kabhi ye question firse try karunga then.
but 2 baar tle and 2 baar submit karne ke baad cases wrong hue the :( kyuki thief 0,0 me hoga uske parinaam ke baare me nhi socha tha fir vs code me debug karne time samjha
Wouldn't it better to set the maximum safe distance for the binary search to be the minimum of the start and end position as no matter what path you take you cannot exceed the values that are present at either of those two indices
you can do that also, no issue, just you need to change one condition mhd[row][col] > safeDistance you nee to continue or return false, both will work, no issue
Multi source BFS Traversal - ua-cam.com/video/vIRIWTQwguM/v-deo.html
BFS Traversal - ua-cam.com/video/kmBJ7IJR_pQ/v-deo.html
Binary Search Template - ua-cam.com/video/UZx_DI4z_l8/v-deo.html
.
3 DSA Mistakes you should never do - ua-cam.com/video/E1x8SEFDKA0/v-deo.html
bro you should do dry run o n a particular example it will be better to understand .
DID it finally thankyou very much.
aapke vid se maine voh multiple bfs ke baare me hint liya aur binary search ka concept use kiya ! ab but dar lag rha hai ki sach me ache se kiya ya bas ratta maar liya jaise aapke 3 mistakes wale vid me aapne bataya tha. baad me kabhi ye question firse try karunga then.
but 2 baar tle and 2 baar submit karne ke baad cases wrong hue the :( kyuki thief 0,0 me hoga uske parinaam ke baare me nhi socha tha fir vs code me debug karne time samjha
nicely explained, Thanks a ton❤
Thanks For the explanation!
great work bro
Niceee
Thanks bro!
arey yaar maqsad😭😭😂😂😂😂😂😂
understood
❤
leetcode ne aukd dika di
Wouldn't it better to set the maximum safe distance for the binary search to be the minimum of the start and end position as no matter what path you take you cannot exceed the values that are present at either of those two indices
you can do that also, no issue, just you need to change one condition mhd[row][col] > safeDistance you nee to continue or return false, both will work, no issue
bhayia if possible pls share your slide also
bhai tum bolte bhut jada ho .... confusion ho jata h kbhi kbhi
Can you please provide code for this?
class Solution {
public:
vector rowDir = {-1,1,0,0};
vector colDir = {0,0,-1,1};
bool isValid(vector &visited,int i, int j){
if(i
bro can you please share the pdf .....
sometimes you are confusing as hell,
Bahot zyada confuse kerte ho bhai