Although I had faith but my mind was not ready for such an easy explanation for yet a very difficult topic (Branch and Bound) and a hard question, understood completely in one go. Thanks a lot Sir ❤
You make every topic so simple to understand. Most importantly you enable the students to think in a particular direction and solve problems on their own. Thank you for all this amazing content and the efforts you put in to teach so phenomenally. Huge respect!!!!
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 my efforts, I request a review g.page/Pepcoding/review?rc
Sir, after describing the problem with the solution method and code if you also describe the time complexity along with the method and in the code section it will helpful for me or us. Thanks, sir for your effort, your teaching technique is very much clear and enjoyable.
Thankyou buddy! I am glad. Your kind words are the kind of motivation that truly help me in making more and more content. Especially, these days, not everybody is generous with motivating anybody either. It means a lot. 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, in this question we don't even need 2d array, we just need the size of it, which is n. There's no use of 2d array, we just need column[ ], leftDiagonal[ ] and rightDiagonal[ ]. BTW great explaination sir maza aagya.
Thankyou beta, for such kind words. 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/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
Most welcome and If you like the content could you post something on LinkedIn about us? This will help us in reaching out to more people and help a lot of other students as well Something like this 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
u r the best person yaar .. I am able to understand this question after a very long time .. wish u the best of luck .. u r really doing a great job. :)
Thankyou beta! I am glad you liked it. I also hope that you are watching till the end and trying to understand the what, how, and especially why of the problem. If you like our efforts, will you like to review us here - g.page/Pepcoding/review?rc
Are you first placing Queen in all the rows of column 1 , then rows of column 2 , the rows of column 3 etc ? Or in all the columns in row 1 , then columns in row 2 etc ? Pls tell i have little confusion here.
If there is no return statement except in row== board.length, what does the function return when it doesn't find the solution on that particular row. Should we add a return statement or it is handled by the compiler itself??
Just out of curiosity....Every recursive algorithm can be converted in iterative one but I've never seen any backtracking algorithm done in iterative way. Can't we do this way??
@Pepcoding sir hum baaki cols and diagonal array m to true krre h And board m true krke use aage kahi use Ni Kiya Bas backtrack ke time false kiya h Isliye agar na likhe to?
@@somyasinghal9809 haa bro code to submit hora hai import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner scn = new Scanner(System.in); int n = scn.nextInt(); int[] c = new int[n]; int[] d1 = new int[2*n-1]; int[] d2 = new int[2*n-1]; printNqueens("",0,c,d1,d2); } public static void printNqueens(String qsf,int r,int[] c,int[] d1,int[] d2){ if(r == c.length){ System.out.println(qsf + "."); return; } for(int i = 0; i
If explaining code/intution/approach is an art, then sumeet sir is among top artist. ♥️♥️
Although I had faith but my mind was not ready for such an easy explanation for yet a very difficult topic (Branch and Bound) and a hard question, understood completely in one go. Thanks a lot Sir ❤
You make every topic so simple to understand. Most importantly you enable the students to think in a particular direction and solve problems on their own. Thank you for all this amazing content and the efforts you put in to teach so phenomenally. Huge respect!!!!
The way u explaining this hard algorithm is fantastic,, Literally for these 30 min I was completely focused on this video Lecture. Thank You sir...
Your vidoes are always so good, time just flies. I don't find it hard to stay focused. Thanks for all your hard work.
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 my efforts, I request a review
g.page/Pepcoding/review?rc
@@Pepcoding Sir , I submitted my review last week :)
Sir, after describing the problem with the solution method and code if you also describe the time complexity along with the method and in the code section it will helpful for me or us. Thanks, sir for your effort, your teaching technique is very much clear and enjoyable.
Sir your channel will become best yt channel for coding....content is extremely good thanks for sharing best knowledge lots of love❤️
Thankyou buddy!
I am glad. Your kind words are the kind of motivation that truly help me in making more and more content. Especially, these days, not everybody is generous with motivating anybody either. It means a lot.
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 )
Sure sir
This is the simplest solution of NQueen problem I could ever get, you made it too easy, Thanks Sirji.
I am glad you liked it
Sir, in this question we don't even need 2d array, we just need the size of it, which is n. There's no use of 2d array, we just need column[ ], leftDiagonal[ ] and rightDiagonal[ ]. BTW great explaination sir maza aagya.
I wish I could like it multiple times, Thank you so much Sumeet sir and the team of @pepcoding
beta, linkedin pe ek post likh do. Ya google pe review dedo. Help will be much appreciated.
Thanks,
Sumeet Malik
@@Pepcoding Sure Sir, I will definitely do.
@Delphine Furnia shut up no one cares
we are happy, because we have a teacher like you.
Explanation was so simple! Thank you so much!
Glad it helped! For better experience and well organised content sign up on nados.io and keep learning.
Waah sir ji. Level up start krne k liye dhanyawad. Ab na mja aayega bhiru..
Ab dusre channel pe jaakar bilkul riks ni lene ka re baba 😁😁
@@NK6722-nk ha ha
thank you
When god comes himself to teach us. God level teaching sir🔥🔥🔥
Great video! Thanks for this lucid explanation
Explained in a very Amazing Way. Thanks a lot Sir
You are most welcome. Thanks for the kind words
Sir you are at the upper bound of best teaching!!! And sir what will be the time complexity of the solution and how?
clearly understand the meaning of branch and bound
Your explanations are just amazing...
Thank you so much beta
Guru ji bhot bhot dhanyavaad videos ke lie.
ji. padhie.
Thank you SIR .. I was trying to understand it from many days .. aaj samgh aaya ... thank you
Thankyou beta, for such kind words.
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/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
@@Pepcoding sure Sir
Best teacher❤
Thanks a lot sir...for the entire playlist..
Most welcome and If you like the content could you post something on LinkedIn about us? This will help us in reaching out to more people and help a lot of other students as well
Something like this
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
u r the best person yaar .. I am able to understand this question after a very long time .. wish u the best of luck .. u r really doing a great job. :)
Thank you so much
Nice way of approaching the solution !!
Glad you liked it.Keep watching
Glad you liked it!!
@@Pepcoding Definitely your channel will soon hit million! Keep it up!
I don't have words to thank you sir 😊
Your explanation are always cool ❤️
Keep watching and keep loving Pepcoding😊
Thank you so much sir 🙏
sir plz discuss few time about time complexity at the end in upcoming vedios
I think there is no requirement for Boolean board of n×n dimension. 🙄🤔
Sir you are a god for me.. thanku very much i subscribed your channel through two email id to keep you motivated and also shared this vedio
Thank you! Keep watching...more interesting problems to come.
Really good explanation sir
Keep watching.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
shower of love to you and your hardwork
Thank you so much
thankyou sir🙏🙏❤❤
thankew so much sir....sir what is the time complexity of this solution?
beta n ki power n.
Nice sir
Glad you liked it!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
You are too good man!🔥
Thankyou beta!
I am glad you liked it. I also hope that you are watching till the end and trying to understand the what, how, and especially why of the problem. If you like our efforts, will you like to review us here - g.page/Pepcoding/review?rc
amazing explanation sir
you can find more of our content on nados.pepcoding.com
@@Pepcoding sure sir
someone please help.. after function calling why we false all the parts that we mark true??
backtracking hai
Sir how can i connect to purchase your course?
Sir can u just calculate the time complexity of code
Are you first placing Queen in all the rows of column 1 , then rows of column 2 , the rows of column 3 etc ?
Or in all the columns in row 1 , then columns in row 2 etc ?
Pls tell i have little confusion here.
he is placing rows in col 1 ,then in rows of col 2 and so on... ,i will suggest you to watch n queens video of level 1 backtracking
@@mickyman753 I also think the same . I will watch the video. Thanks
If there is no return statement except in row== board.length, what does the function return when it doesn't find the solution on that particular row. Should we add a return statement or it is handled by the compiler itself??
no need to return anything in that case because in that case u have not placed all the queens in such a way that no queen kills another
then it simply returns to the main function without printing anything . try for 3 .
pls explain time & space complexity also
prabhu , charan sparsh
arey, mitra. dil se dil mila hai.
pepcoding ke websites pe server problem hai please check kro question submit nahi kr pa rahe hai
pepcoding is closed
Beautiful
Mazaa aa gaya
For better experience, visit nados.io, where you will get well curated content and career opportunities.
thank you sir for explanation
Ji padhte rahie
thank you sir
Just out of curiosity....Every recursive algorithm can be converted in iterative one but I've never seen any backtracking algorithm done in iterative way. Can't we do this way??
Kar sakte hain bilkul
hum board[row][col] ko true/false nhi bhi karenge to bhi answer shi aayega
Sir doubt- board[row][col] pe true/false mark karke kya benefit h?
True wale cellski help se baad mei O(1) mei check ho jata hai ki kahan nahi jana.
@@Pepcoding sr yehi kam O(1) me krne ke liye hi to 3 array bnai hai column ki diagonals ki fr board ki zrurt hi kyu hai ?
@@aman6561 Yes, we don't need board in this case. You are right.
sir, isme agar hum board[row][col] ko true mark na kre, tab bhi sahi hai na?
agr true mark nhii krogge to pta kasse chllega ki appne us particular queen ko box maii place krvaya ya nhi
@Pepcoding sir hum baaki cols and diagonal array m to true krre h
And board m true krke use aage kahi use Ni Kiya
Bas backtrack ke time false kiya h
Isliye agar na likhe to?
@@somyasinghal9809 haa bro code to submit hora hai
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int[] c = new int[n];
int[] d1 = new int[2*n-1];
int[] d2 = new int[2*n-1];
printNqueens("",0,c,d1,d2);
}
public static void printNqueens(String qsf,int r,int[] c,int[] d1,int[] d2){
if(r == c.length){
System.out.println(qsf + ".");
return;
}
for(int i = 0; i
may be koi technical issue hai
cleaaaaan code
Thankyou beta!
Keep watching and keep learning😊
Boht hard maze aa rahe hai. (＾∇＾)ﾉ♪
Keep watching bro.
✨✨✨✨✨✨👌
thank you
Wonderful explanation sir