Conversation
idoocs
added
core team
There was a problem hiding this comment.
Pull request overview
This PR adds a Rust implementation for LeetCode problem #975 "Odd Even Jump". The solution uses an ordered set (BTreeMap) combined with memoized depth-first search to efficiently determine the number of starting indices from which one can reach the end of an array following specific jump rules.
Key Changes
- Implements the Odd Even Jump algorithm using BTreeMap for efficient ceiling/floor lookups
- Uses memoized DFS with
Option<i32>for tracking computed states - Follows the same algorithmic approach as existing Python, Java, C++, and Go solutions
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
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
2 participants
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.
No description provided.