Please help me reach out to more students. Maybe you can write abou this channel on linkedin or facebook. Can you post this? My mentor, Sumeet Malik from Pepcoding is making all his content freely available to the community You can check it out here - www.pepcoding.com/resources/ Also, this is the youtube channel - th-cam.com/users/Pepcodingplaylists?view_as=subscriber Use it. This will be really beneficial. #programming #programmers #coding #codingisfun #codingislife #dsalgos #datastructures #algorithms #java #cpp #competitiveprogramming #interviewquestions #micrsoftinterview #amazoninterview #adobeinterview #goldmansachsinterview #leetcodequestions #codechefquestions #codeforcesquestions #freeprogrammingtutorials #freetutorials #freecodingcourses
My Brain to me: Recursion is very tough to digest. My Heart: Meditate on Sumeet Malik Sir.🙃🙃🙃🙃 Hail to the genius...........Hail to the God of Programming.......
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here th-cam.com/users/Pepcodingabout?view_as=subscriber
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review - g.page/Pepcoding/review?rc
Thanx for this video sir but wouldn't move size increase for a matrix bigger than 4x4, so we would be having bigger jumps than 3. Example - for a 5x5 matrix we would be jumpig 5 steps at a time at the last loop when we're at the first index as move size
Oh my bad sir, I watched the question and presumed we could only jump at max 3 a time. Looking at it again. I understood we're allowed maximum jumps of length maxtrix. Just gonna leave this comment here incase anyone has this doubt. Great content sir, I'm sure as soon as CS students find this it's gonna reach millions.
@@ashishgoswami6303 your doubt and your explanation about doubt really helped me , I solved this question by thinking max jump is 3 , I read the question again , but It was not clear about max jump , thanku , your comment helped me
why didn't we check here for the conditon that horizontal moves should be within the maze if we take mutiple steps horizontally of varied lengths ,we could loose the track.i.e we should have used condition to eliminate such cases.
Hello Sir ,Nowadays, prepcodding website is not working ,seems its down from many months, the resources are also not availble to use . is there alternet website you have created ?
Sir pepcoding ke compiler me ek fault hai wo apke bataye gaye method se hi shi kaam kr raha hai mtlb output ka order agr change ho raha hai to wrong answer bata raha hai
Sir basicly apne loop wo kitna bat maximum jump ker sakte hai esliye lagya hai na nhi to normal 8 function likh ker ker sakte the age Input 4*4 ke liye
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Sir you are making a new arrraylist in recursive function so wo har bar new banti jayegi so aise to bahut ans aayenge.Get MazePath mein aisa nahi kiya tha
in java there shallow copy is there and our expectation is in this question is it will return us an arraylist of paths in which we will be having no of paths from that intermidate to destination and after then if i as a src decide then i have to include myself in those paths
sorry sir , but above code have some minute mistake. import java.util.*; public class Main { public static void main (String[] args) throws java.lang.Exception { Scanner src = new Scanner(System.in); int n = src.nextInt(); int m=src.nextInt(); ArrayList paths = printAllMazePathwdJumps(1,1,n,m); System.out.println(paths); } public static ArrayList printAllMazePathwdJumps(int sr ,int sc,int dr,int dc) { if( sr ==dr &&sc==dc) { ArrayList bapath = new ArrayList(); bapath.add(""); return bapath; } ArrayList mypaths = new ArrayList(); //horizental jumps for(int ms =1;ms+sc
Sir ismei wo check kyun nahi lagaya jo batata hai ki kab sirf horizontal move possible jab aap final column se peeche ho and vertical move is possible jab aap bottom row se peeche ho ? jaise pichle getMazePaths walei question mei lagaya tha.
Did anyone tried this code in C++? I don't know why but my program is crashing in VsCode as well as in Sublime Text. Btw Thanks a Lot from Depth of My Heart Sumeet Sir.@PepCoding❤️
Sir: Actual output: [h1h1v1, h1v1h1, h1d1, h2v1, v1h1h1, v1h2, d1h1] Expected output: [h1h1v1, h1v1h1, h1d1, v1h1h1, v1h2, d1h1, h2v1] I am getting WA, just because my sequence of paths is different compared to expected output. Please help
Beta, dhng se website ya channel explore kro, jispr bhi dekh rhe ho aap videos. Here's is the link of some questions on GT- www.pepcoding.com/resources/online-java-foundation/generic-tree
public class MazePathJump { // move is horizontal or vertical private static void mazesolve(int i, int j, int n,int [][] maze,int [][] path) { if(i=n || maze[i][j]==0 || path[i][j]==1 ) return;
Sir, aap is era ke best teacher hain. Aapka birthday 21st century ka teachers day ke roop mein manana chahie.
Please help me reach out to more students. Maybe you can write abou this channel on linkedin or facebook.
Can you post this?
My mentor, Sumeet Malik from Pepcoding is making all his content freely available to the community
You can check it out here - www.pepcoding.com/resources/
Also, this is the youtube channel - th-cam.com/users/Pepcodingplaylists?view_as=subscriber
Use it. This will be really beneficial.
#programming #programmers #coding #codingisfun #codingislife #dsalgos #datastructures #algorithms
#java #cpp #competitiveprogramming #interviewquestions #micrsoftinterview #amazoninterview
#adobeinterview #goldmansachsinterview #leetcodequestions #codechefquestions #codeforcesquestions
#freeprogrammingtutorials #freetutorials #freecodingcourses
@@Pepcoding for sure
@@Pepcoding even i did this
My Brain to me: Recursion is very tough to digest.
My Heart: Meditate on Sumeet Malik Sir.🙃🙃🙃🙃
Hail to the genius...........Hail to the God of Programming.......
Always with you beta padhte rahe kabhi haar nahi manni h mehnat ke aage sab aasaan hai
Right 😉
Not only I learn recursion very well par meri hindi aur bhi achhi ho gayi 👍👍👍
Watched on 25 October, 2021 - Thank you very much for the video.
sir I am totally impressed with your logic making skills, I really want to make logics like you..very easily and simple..
You are great sir. I was just thinking why cant we implement previous code this way!! and here it is!!.
I Feel that Pepcoding Should apply for Guiness World Record for "Most Number Of Coding Question's Solution On TH-cam" .
Nice explanation
Feedback - it would be good if variable names are proper. It will increase user readability and ease to understand.
please help .
sir i've written my code in cpp my output is wrong and test cases failed and your website also does not have the solution.
please help.
Thank u sir. ur each video tutorial is a gold
Thanks and welcome
Sir your singing , and choice of songs are also great though !!
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
th-cam.com/users/Pepcodingabout?view_as=subscriber
@@Pepcoding bot 🤣
Sir you are doing great job....
Keep watching. Also, share and subscribe.
Sir ur approach is great 💯
no need to check for >dr || >dc in base case since loop is running till
Correct
Awesome explanation!!
Glad you think so!
amazing way of teaching , loved it @sumit sir.
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review - g.page/Pepcoding/review?rc
@@Pepcoding done ✅
Thanx for this video sir but wouldn't move size increase for a matrix bigger than 4x4, so we would be having bigger jumps than 3.
Example - for a 5x5 matrix we would be jumpig 5 steps at a time at the last loop when we're at the first index as move size
Oh my bad sir, I watched the question and presumed we could only jump at max 3 a time. Looking at it again. I understood we're allowed maximum jumps of length maxtrix. Just gonna leave this comment here incase anyone has this doubt.
Great content sir, I'm sure as soon as CS students find this it's gonna reach millions.
@@ashishgoswami6303 your doubt and your explanation about doubt really helped me , I solved this question by thinking max jump is 3 , I read the question again , but It was not clear about max jump , thanku , your comment helped me
why didn't we check here for the conditon that horizontal moves should be within the maze if we take mutiple steps horizontally of varied lengths ,we could loose the track.i.e we should have used condition to eliminate such cases.
Hello Sir ,Nowadays, prepcodding website is not working ,seems its down from many months, the resources are also not availble to use .
is there alternet website you have created ?
Sir you can't directly add ms with characters as it is an Integer . So first of all we have to convert ms into string.
for line no 43 it worked for me *d
Sir pepcoding ke compiler me ek fault hai wo apke bataye gaye method se hi shi kaam kr raha hai mtlb output ka order agr change ho raha hai to wrong answer bata raha hai
great sir
Sir basicly apne loop wo kitna bat maximum jump ker sakte hai esliye lagya hai na nhi to normal 8 function likh ker ker sakte the age
Input 4*4 ke liye
yes. par loop to 5 * 5 aur 6 * 6 ke liye bhi chalega 8 calls to 4 * 4 ke liye he chalega
Thank you so much sir!!
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
sir jump can be for( int jump=1;jump+sc
yes
Why we done dc-sc and dr-sr
Sir you are making a new arrraylist in recursive function so wo har bar new banti jayegi so aise to bahut ans aayenge.Get MazePath mein aisa nahi kiya tha
iss question ko krne se zayada mza iska output dekhne main hai. it will be huge. mera vs code hi crash maar gya 5 *5 matrix ke liye
If you like our efforts, will you like to review us here - g.page/Pepcoding/review?rc
Keep learning and keep loving Pepcoding😊
🙌
Sir esme apne array ki jo new list bnayi hai wo her bar new bnenti jayega to ek hi paths nhi hoga wo to bahut sare path ben jayenge
in java there shallow copy is there and our expectation is in this question is it will return us an arraylist of paths in which we will be having no of paths from that intermidate to destination and after then if i as a src decide then i have to include myself in those paths
sorry sir ,
but above code have some minute mistake.
import java.util.*;
public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner src = new Scanner(System.in);
int n = src.nextInt();
int m=src.nextInt();
ArrayList paths = printAllMazePathwdJumps(1,1,n,m);
System.out.println(paths);
}
public static ArrayList printAllMazePathwdJumps(int sr ,int sc,int dr,int dc)
{
if( sr ==dr &&sc==dc)
{
ArrayList bapath = new ArrayList();
bapath.add("");
return bapath;
}
ArrayList mypaths = new ArrayList();
//horizental jumps
for(int ms =1;ms+sc
Sir ismei wo check kyun nahi lagaya jo batata hai ki kab sirf horizontal move possible jab aap final column se peeche ho and vertical move is possible jab aap bottom row se peeche ho ?
jaise pichle getMazePaths walei question mei lagaya tha.
Wo for loop ki condition se check ho ja rahi bhaii...ki apan deewar pel ke bahar na ja sake..
@@abhishekanand5898 par bhai wo for loop toh sirf ye decide krne ke liye hai ki hum kitna bada jump marenge
@@rahulrana8912 jump aur constriant dono decide ho rhi bhai...ek bar 3*3 pe dry run smjh aajyega
@@abhishekanand5898 hn thanks brother👍
Sir remaning topic kab tak upload honge??
Beta, jaldi he resume krege content upload krna.
2022
sir please start interviewBit question of top comapnies
Beta, level-2 main check kro bits k thore questions daale h
There is no videos on trees
Did anyone tried this code in C++?
I don't know why but my program is crashing in VsCode as well as in Sublime Text.
Btw Thanks a Lot from Depth of My Heart Sumeet Sir.@PepCoding❤️
Send me yr code
I had a issue but now it is running on my vs
@@divyanshuyadav5524 Bhai can u plz send your c++ code
@@aniketghosh2001 let me try...cauz it is quite difficult for me to send the code here 😔
even I am unable to code this in c++. Kindly help if you have figured out the solution
Sir:
Actual output:
[h1h1v1, h1v1h1, h1d1, h2v1, v1h1h1, v1h2, d1h1]
Expected output:
[h1h1v1, h1v1h1, h1d1, v1h1h1, v1h2, d1h1, h2v1]
I am getting WA, just because my sequence of paths is different compared to expected output. Please help
sir there is no video on trees
Beta, dhng se website ya channel explore kro, jispr bhi dekh rhe ho aap videos. Here's is the link of some questions on GT- www.pepcoding.com/resources/online-java-foundation/generic-tree
public class MazePathJump {
// move is horizontal or vertical
private static void mazesolve(int i, int j, int n,int [][] maze,int [][] path) {
if(i=n || maze[i][j]==0 || path[i][j]==1 )
return;
path[i][j]=1;
if(i==n-1 && j==n-1){
for(int r=0;r