Summary
Full Transcript
Recursion BackTracking #dsa #graph #datastructure What is Graphs in DSA and why do we need it. We talked about it with the help of real world example and it will help everyone to get command over graphs. Day 25/60 of challenge..... 1: N-Queens: https://leetcode.com/problems/n-queens/ 2: M-Coloring Problem: https://www.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1 3: Sudoku Solver: https://leetcode.com/problems/sudoku-solver/ 00:00 Introduction to Backtracking 1:31 Problem 1 - N queens 22:10 Code Part - N queens 39:35 Time and Space Complexity 42:40 Problem 1 - Optimizing Code - N queens 56:30 Code Part - Optimized Code - N queens 1:02:03 Problem 2 - M coloring Problem 1:06:54 Understanding with Example 1:27:57 Code Part - M - Coloring Problem 1:44:17 Problem 2 -- Mehtod 2 - M Coloring Problem 1:48:45 Code Part -Method 2 - M Coloring Problem 1:55:43 Problem 3 - Sudoku Solver 2:20:40 Code Part - Sudoku Solver 2:32:00 Time and Space Complexity 2:33:15 Last Note Video will come on Mon-Fri at 6am in the morning DSA Course for free C++ Free Course Rohit Negi DSA Course C++ Coder Army DSA Course c++ Function in C++ Pointers in C++. Strings Vector Introduction to Recursion Join Our Whatsapp Channel: https://whatsapp.com/channel/0029Va6H0tbHVvTbcuT99Y1f connect to me on Instagram: https://rohit978.page.link/insta Linkedin: https://rohit978.page.link/linkedin Telegram: https://rohit978.page.link/telegram
