added circular queve game in python#31
Open
roshankraveendrababu wants to merge 3 commits intogdgpce:mainfrom
Open
added circular queve game in python#31roshankraveendrababu wants to merge 3 commits intogdgpce:mainfrom
roshankraveendrababu wants to merge 3 commits intogdgpce:mainfrom
Conversation
added 3 commits
October 7, 2024 18:43
-tracking branch 'origin/main'
This comment was marked as duplicate.
This comment was marked as duplicate.
Saket6198
requested changes
Oct 21, 2024
Collaborator
Saket6198
left a comment
There was a problem hiding this comment.
@roshankraveendrababu only commit the required file for the aforementioned issue, dont add solutions for other issues in your PR else it will be rejected.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
#17
the code for implementing circular queve game was added in python along with its examples and constraints in a seperate folder.
the intuition behind the code is :
A variable idx is initialized to 0
The loop continues while there are more than one friend left in the circle
the formula (idx + k - 1) % len(friends) is used to eliminate friends
The friend at the computed idx is eliminated using pop() and the process is repeated
when only one friend remains, that friend is the winner and the function returns this friend
the code also has algorithm and comment for each line for easy understanding ..