Add new code to fix errors in Frog_Jump.py#131
Open
aritradey-CS wants to merge 1 commit intowbhoomika:mainfrom
Open
Add new code to fix errors in Frog_Jump.py#131aritradey-CS wants to merge 1 commit intowbhoomika:mainfrom
aritradey-CS wants to merge 1 commit intowbhoomika:mainfrom
Conversation
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
1 participant
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.
Two implementations
one using a stack and another using dynamic programming (dp). Both implementations are correct, but the dp implementation is not very efficient. The issue with the dp implementation is that it has a time complexity of O(n^2) in the worst case, making it less efficient for larger inputs.
If you want to improve the efficiency of the dp implementation, you can use a dictionary to store the valid jump sizes for each stone, which will reduce the lookup time.
Thank you for your consideration @wbhoomika