N-Queens | 2 Approaches | Super Detailed | Magic Of Recursion | Recursion Concepts And Questions

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=FOY49yQcbQ4



Duration: 1:06:37
803 views
53


iPad PDF Notes - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/iPad%20PDF%20Notes/Recursion%20Concepts%20%26%20Qns%20-%2014.pdf
Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 14th video of our playlist "Recursion Concepts And Questions". Find the Details below :

Video Name : N-Queens | 2 Approaches | Magic Of Recursion | Recursion Concepts And Questions
Video # : 14
C++/Java Code Link : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Backtracking/N-Queens.cpp
Leetcode Link : https://leetcode.com/problems/n-queens/description/
GFG Link : https://www.geeksforgeeks.org/problems/n-queen-problem0315/1


πŸ” Unraveling Recursion: A Journey into the Depths of Code

πŸŽ₯ Welcome to the 14th Video of my Recursion Playlist! πŸš€ In this enlightening video, we will solve a very famous recursion/backtracking problem "N-Queens". We will start with a Simple story understanding the problem and then we will be Converting Story to code and writing the recursive code for the problem and also I will also be explaining the Time and Space Complexity of the code 🌐. We will be solving it using 2 Approaches.

πŸ” What's Inside?

πŸ”— Simple story understanding with 2 Approaches

πŸ”— Converting Story to code and writing the recursive code for N-Queens problem

πŸ”— Explanation of Time and Space Complexity of the code

πŸ‘©β€πŸ’» Who Should Watch?

This playlist is for everyone but best suited for Freshers who are new to Recursion.

πŸš€ Embark on the Recursive Adventure Now!

My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK


Approach Summary :
Approach-1 (Simple DFS): This approach uses a simple depth-first search (DFS) algorithm to solve the N-Queens problem. The time complexity is O(N!), where N is the size of the chessboard. The algorithm checks the validity of placing a queen in each cell by examining the rows, left diagonals, and right diagonals above the current position. The DFS explores all possible configurations by placing queens row by row and backtracking when necessary. The space complexity is O(N) to store the result.

Approach-2: This approach also employs DFS to solve the N-Queens problem, but with an optimized representation using sets to keep track of occupied columns, diagonals, and anti-diagonals. This reduces the redundant validity checks in the original approach. The time complexity remains O(N!), and the space complexity is O(N) for the result and the sets used to track column, diagonal, and anti-diagonal occupancy. The algorithm places queens row by row, updating the sets accordingly, and backtracks when needed to explore all possible configurations.

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
β•‘β•šβ•£β•‘β•‘β•‘β•šβ•£β•šβ•£β•”β•£β•”β•£β•‘β•šβ•£β•β•£
β• β•—β•‘β•šβ•β•‘β•‘β• β•—β•‘β•šβ•£β•‘β•‘β•‘β•‘β•‘β•β•£
β•šβ•β•©β•β•β•©β•β•©β•β•©β•β•©β•β•šβ•©β•β•©β•β•

✨ Timelines✨
00:00 - Introduction
00:55 - Problem Explanation
09:01 - Approach 1 Thought Process
17:43 - Story To Code Points for Approach 1
35:12 - Coding Approach 1
44:41 - Space and Time Approach 1
49:04 - Approach 2 Thought Process
01:01:59 - Coding Approach 2

#codestorywithMIK
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #2024 #newyear #RecursionExplained #CodingJourney #Programming101 #TechTalks #AlgorithmMastery #Recursion #Programming #Algorithm #Code #ComputerScience #SoftwareDevelopment #CodingTips #RecursiveFunctions #TechExplained #ProgrammingConcepts #CodeTutorial #LearnToCode #TechEducation #DeveloperCommunity #RecursiveThinking #ProgrammingLogic #ProblemSolving #AlgorithmDesign #CSEducation




Other Videos By codestorywithMIK


2024-02-28Even Odd Tree | DFS | BFS | Leetcode 1609
2024-02-28Permutations II | Two Approaches | Detailed | Recursion Concepts And Questions
2024-02-27Find Bottom Left Tree Value | 3 Approaches | Simple Story | Microsoft | Leetcode 513
2024-02-27Power Set | Same as Subsets | Magic Of Recursion | Recursion Concepts And Questions
2024-02-26Diameter of Binary Tree | Simple Story | Amazon | Leetcode 543
2024-02-26Earliest Second to Mark Indices I | Detailed Intuition | Leetcode Weekly Contest 386 | Leetcode 3048
2024-02-25Generate Parentheses | 2 Approaches | Magic Of Recursion | Recursion Concepts And Questions
2024-02-25Greatest Common Divisor Traversal | Why Graph | Why DSU | Google | Leetcode 2709
2024-02-24Find All People With Secret | 4 Approaches | Google | Leetcode 2092
2024-02-23Thank you and Love You All β€οΈπŸ™
2024-02-23N-Queens | 2 Approaches | Super Detailed | Magic Of Recursion | Recursion Concepts And Questions
2024-02-21Bitwise AND of Numbers Range | 2 Approaches | Dry Run | Leetcode 201
2024-02-19Missing Number | Multiple Approaches | Leetcode 268
2024-02-19Flattening a Linked List | Magic Of Recursion | Recursion Concepts And Questions | Video 13
2024-02-18Power of Two | Multiple Approaches | Leetcode 231
2024-02-18Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402
2024-02-16Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642
2024-02-16Flatten BST to sorted list | Magic Of Recursion | Recursion Concepts And Questions | Video 12
2024-02-16Least Number of Unique Integers after K Removals | 3 Approaches | Greedy | Leetcode 1481
2024-02-15Rat in a Maze Problem | Simple Story To Code | Recursion Concepts And Questions | Video 11
2024-02-14Find Polygon With the Largest Perimeter | Thought Process | Greedy | Leetcode 2971