Find the Winner of the Circular Game | 3 Approaches | Leetcode 1823 | codestorywithMIK
430Whatsapp Community Link : https://www.whatsapp.com/channel/0029...
This is the 3rd Video of our Playlist "RECURSION : Popular Interview Problems" by codestorywithMIK
In this video we will try to solve a very famous Recursion problem : Find the Winner of the Circular Game | 3 Approaches | Easy Explanations | Leetcode 1823 | codestorywithMIK
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Find the Winner of the Circular Game | 3 Approaches | Easy Explanations | Leetcode 1823 | codestorywithMIK
Company Tags : Goldman Sachs, Amazon
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Intervie...
Leetcode Link : https://leetcode.com/problems/find-th...
My DP Concepts Playlist : • Roadmap for DP | How to Start DP ? | ...
My Graph Concepts Playlist : • Graph Concepts & Qns - 1 : Graph will...
My Recursion Concepts Playlist : • Introduction | Recursion Concepts And...
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie...
Instagram : / codestorywithmik
Facebook : / 100090524295846
Twitter : / cswithmik
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Summary :
Approach 1: Brute Force (Simple Simulation)
Time Complexity: O(n^2)
Space Complexity: O(n)
Description: This approach uses a vector/ArrayList to simulate the elimination process. It iteratively calculates the index of the player to be eliminated, removes the player from the list, and continues until only one player remains. The index of the next player to be eliminated is adjusted using modulo arithmetic.
Approach 2: Using Queue for Simulation
Time Complexity: O(n * k)
Space Complexity: O(n)
Description: This method employs a Queue to simulate the game. Players are added to the queue initially. In each iteration, players up to k-1 are moved to the back of the queue, and the k-th player is removed. This process is repeated until only one player remains in the queue.
Approach 3: Using Recursion
Time Complexity: O(n)
Space Complexity: O(1) (but O(n) due to recursion stack)
Description: This recursive approach calculates the index of the winning player directly. It uses a helper function to find the winner index for n-1 players and adjusts this index to reflect the position in the original group of n players. The base case handles the scenario with only one player left, returning index 0.
Each approach offers a different balance of time and space complexity, allowing for flexibility based on the specific constraints and requirements of the problem.
✨ Timelines✨
00:00 - Introduction
05:15 - Approach-1 (Simulation using Array)
14:23 - Approach-2 (Simulation using Queue)
19:40 - Approach-3 (Recursive Approach)
#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 #newyear2024