Here we cover some important #backtracking questions such as N-Queens, N-Knights, Sudoku Solver (LeetCode), including theory + code + tips on how to solve such problems in various ways.

Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!

👉 Resources
- Join Replit: http://join.replit.com/kunal-kushwaha
- Complete Java DSA playlist:    • Java + DSA + Interview Preparation Co...  
- Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA...

➡️ Connect with me: http://kunalkushwaha.com

=========================================
Timestamps:
0:00:00 Introduction
0:00:57 Q1 : N-Queens Problem
0:02:13 How to determine if a problem is of recursion and backtracking?
0:20:12 Code for N-Queens Problem
0:32:05 Complexity Analysis (Correction: Linear Recurrence Relation Method*)
0:37:48 How to eliminate for loops?
0:39:01 Q2 : N-Knights Problem
0:44:05 Code for N-Knights Problem
0:52:51 Q3 : Sudoku Solver Problem (LeetCode)
1:06:47 Code for Sudoku Solver Problem
1:07:38 Correction: board[row][i] == num
1:10:47 Code for Sudoku Solver Problem
1:17:03 Complexity Analysis for Sudoku Solver Problem
1:18:20 Outro

#recursion #placement #dsa #interviews