Completed
The N Queens Problem using Backtracking/Recursion - Explained
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Dynamic Programming, Recursion, and Backtracking
Automatically move to the next video in the Classroom when playback concludes
- 1 The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
- 2 Egg Dropping Problem: Dynamic Programming Fundamentals & Understanding Subproblem Decomposition
- 3 Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems
- 4 Range Sum Querying - Preventing Repeated Work With Caching ("Range Sum Query" on Leetcode)
- 5 Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)
- 6 Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)
- 7 Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode)
- 8 The Recursive Staircase - Top Down & Bottom Up Dynamic Programming ("Climbing Stairs" on LeetCode)
- 9 Generate All Strings With n Matched Parentheses - Backtracking ("Generate Parentheses" on LeetCode)
- 10 Count Total Unique Binary Search Trees - The nth Catalan Number (Dynamic Programming)
- 11 Compute The Next Permutation of A Numeric Sequence - Case Analysis ("Next Permutation" on Leetcode)
- 12 The Change Making Problem - Fewest Coins To Make Change Dynamic Programming
- 13 Total Ways To Decode A String - Recursive Dynamic Programming Approach ("Decode Ways" on LeetCode)
- 14 Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode)
- 15 Partition To K Equal Sum Subsets From An Array of Integers - The Backtracking Approach
- 16 Implement A Sudoku Solver - Sudoku Solving Backtracking Algorithm ("Sudoku Solver" on LeetCode)
- 17 Generate All Palindromic Decompositions Of A String ("Palindrome Partitioning" on Leetcode)
- 18 Find The Longest Increasing Subsequence - Dynamic Programming Fundamentals
- 19 How To Permute A String - Generate All Permutations Of A String
- 20 The IP Address Decomposition Problem - Compute All Valid IP Addresses From Raw IP String
- 21 The 0/1 Knapsack Problem (Demystifying Dynamic Programming)
- 22 Compute All Mnemonics For A Phone Number (Recursion/Backtracking Problem)
- 23 The N Queens Problem using Backtracking/Recursion - Explained
