N Queen Problem Using Backtracking Algorithm

Given nxn board and n queens. Place these queens on this board so that they do not attack each other.

[BackToBackSWE]

Awesome explanation. You inspired me to make my own version of this video for explanation.

[darraghosullivan]

Tushar, these videos are phenomenal. It's very apparent that you have spent a lot of time preparing this material - your explanations and examples are incredibly clear. Thanks!!!

[chiraggupta]

I have never written comment on any video whether it is good or not, But your videos force me to write comment, By heart you are Genius man !!!
Legend of Computer

[RomanTimm]

I can't put into words how much these videos help me and my friends understand the subject you cover!
No way in a million years that my professor will go that deep into the explanation of the all the little (but very important) details you do explain.
Please, please cover more topics in the future! :)

[samaryadav]

just my opinion: 95% of Indian engineering students waste average 6 hours per day in colleges learning shit. We can easily understand actual concepts on youtube in 2 hours and through books for extra. Shit and lazy ass professors and money making colleges. Don't want to hurt anyone's sentiments but IT's THE F TRUTH. Thanks Tushar bhai. I am grateful to you.

[DineshYadav]

I have seen most of your videos and just wants to say a big thanks. you are a role model for many young people coming out and wants to achieve something big in their life....

[siddhantsharma]

The legend of Computer Science. Yesterday I had lots of problems regarding coding a solution for this problem, now I don't have any. Brilliant video!

[JungleLoveOeOeO]

The tree visual was fantastic. It allowed me to visualize how the algorithm was eliminating possibilities and backtracking to the first level to start over.

[jacktorrance]

I've watched 3 videos prior to yours' on this topic and so far you've done the best job explaining it. Thanks.

[AlbertLeng]

Thank you Tushar! Your explanation is really clear and makes sense. It saves me tons of time and makes my day! I hope you can continue to upload more videos.

[remusik]

For the diagonal condition there is an alternate. Given two cells with the coordinates (i1, j1) and (i2, j2), you can say they are on the same diagonal if | i1 - i2 | = | j1 - j2 | . You can validate this by calculating with values, or you can deduce it from the two formulas you have stated. This way you only need a single formula to validate if the queens attack on diagonal.

[jamesmitchell]

Best explanation I have seen yet. Thank you!

[ratmouse]

this is a great video. Always helps me a ton to see stuff drawn out like this.

[jayantaa]

I admire your visual presentation and clean code matching your flow of explaining the algorithm.

[skootergofast]

Thank you for making me understand I have got from your explanations is something very valuable....I got to learn the concept of Recursion, Back Tracking and Dynamic programming. After understanding the concept, I am able to code it myself. Thank you

[ayushpalak]

every time a problem bothers me, I find video of you explaining it :) you are awesome .

[hrishikeshwaikar]

Great Explaination Tushar. Kindly consider doing the Graph Coloring problem using backtracking as well!

[chamnil]

You are a hero at explaining things.WELL DONE SIR.THANK YOU MUCH.

[simrandotdev]

Thanks a lot Tushar. Your Backtracking videos are really awesome. And I really appreciate you explaining things on a whiteboard rather that PPTs. Your code examples are also really clean and simple to understand which is very hard to find to algorithms videos. I hope you keep creating these videos and help us achieve our goals of working in bigger companies.

Thanks a lot once again.

[floracao]

Your explaination is always clear and easy to understand! Thanks for your videos!