Listen "Knight tour problem"
Episode Synopsis
This is also an Recursion problem with Backtracking, in which we have to determine all the possible configuration of knight's moves in a chess board
More episodes of the podcast algodextrous
Maximum Sum Non Adjacent Elements
07/08/2021
Count A+B+C+ Subsequences
07/08/2021
Count Encodings
23/07/2021
Arrange Buildings
23/07/2021
Count Binary Strings
03/07/2021
Fractional Knapsack
31/05/2021
Unbounded Knapsack
31/05/2021
Zero One Knapsack
30/05/2021
Coin Change Permutations
30/05/2021
ZARZA We are Zarza, the prestigious firm behind major projects in information technology.