feat: add rust solution to lc problem: No.3583 #4892
Merged
+106
−0
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
idoocs
added
md
There was a problem hiding this comment.
Pull request overview
This PR adds a Rust solution for LeetCode problem 3583 (Count Special Triplets). The solution implements an efficient O(n) algorithm using hash tables to count triplets where the middle element is half of the values at the outer positions.
Key changes:
- Added a Rust implementation using HashMaps to track element frequencies on the left and right sides of each potential middle element
- The solution correctly handles the modulo arithmetic (10^9 + 7) requirement using i64 to prevent overflow
- The algorithm matches the approach used in other language implementations (Python, Java, C++, TypeScript, Go)
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
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.
No description provided.