[Java] Leetcode 37. Sudoku Solver [Backtracking #8]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 37. Sudoku Solver which is related to Backtracking.

Here’s a quick rundown of what you’re about to learn:
⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (1:58) Solution Explain
⌨️ (10:28) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 37. Sudoku Solver and questions that are similar to this Backtracking.

Now, if you want to get good at Backtracking, please checkout my Backtracking playlist.

Рекомендации по теме
Комментарии
Автор

I just started watching but kudos for actually explaining the back tracking logic, other videos don't make that effort.

kreender
Автор

most readable code so far i have seen for sudoku solver

shahaalap
Автор

Hello Eric, Thank you so much for all the videos on your channel. I'm so grateful for your lessons.
I can't believe I actually understand every line in 2 watches. This is a really great tutorial -Thanks again man!

somhua
Автор

I haven't seen better explanation! Thank you!

blabberq
Автор

1) I believe Brute-Force is the only way to solve this puzzle, no DP at all.
2) Time complexity = O(N^m) ... N = 9 & m = empty cells
3) Space complexity = O(1) .. since we aren't taking any extra cells

If this is asked in interview and the candidate is seeing this question for the first time, he/she will waste sometime thinking about a DP formula which does not exist and finally fallback to brute-force with little time left to write the code. Identifying whether a problem has only-brute-force and no other technique is a skill that a candidate must develop for cracking interviews.

dataman
Автор

Very good explenation. I like the drawing tool you used:). Would you mind share what tool extension you draw on web page? Thanks

onlineservicecom
Автор

What is the name of the application used for drawing? Thanks, great video.

ErkaSain