feat: add ts solution to lc problem: No.3578 #4880
Merged
+87
−1,866
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
core team
There was a problem hiding this comment.
Pull request overview
This PR adds a TypeScript solution for LeetCode problem 3578 "Count Partitions With Max-Min Difference at Most K". The solution implements a dynamic programming approach with a sliding window technique using an AVL tree to efficiently track maximum and minimum values.
- Implements the sliding window + DP algorithm with O(n log n) time complexity
- Uses
datastructures-jsAVL tree for efficient min/max tracking with duplicate support - Follows the same algorithm pattern as existing Python, Java, C++, Go, and Rust solutions
💡 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.