Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

N-Queens, N-Knights, Sudoku Solver - Backtracking Questions

Kunal Kushwaha via YouTube

Start learning Write review
OpenLearning Ad

Master AI and Machine Learning: From Neural Networks to Applications

Learn More → Scrimba Ad

Get 20% off all career paths from fullstack to AI

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
The course introduces recursion and backtracking through N-Queens, N-Knights, and Sudoku Solver problems. It walks through implementations and complexity analysis.

Syllabus

Introduction
Q1 : N-Queens Problem
How to determine if a problem is of recursion and backtracking?
Code for N-Queens Problem
Complexity Analysis Correction: Linear Recurrence Relation Method*
How to eliminate for loops?
Q2 : N-Knights Problem
Code for N-Knights Problem
Q3 : Sudoku Solver Problem LeetCode
Code for Sudoku Solver Problem
Correction: board[row][i] == num
Code for Sudoku Solver Problem
Complexity Analysis for Sudoku Solver Problem
Outro

Taught by

Kunal Kushwaha

Reviews

Start your review of N-Queens, N-Knights, Sudoku Solver - Backtracking Questions

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.