-
-
Notifications
You must be signed in to change notification settings - Fork 9.1k
feat: add ts solution to lc problem: No.3578 #4880
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
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.
No description provided.