feat: add solutions for lc No.3634

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds complete solutions for LeetCode problem 3634 "Minimum Removals to Balance Array" (使数组平衡的最少移除数目), a medium-difficulty problem from Biweekly Contest 162 Q2.

Changes:

• Added two solution approaches: sorting with binary search (Solution 1) and sorting with two pointers (Solution 2)
• Implemented solutions in Python, Java, C++, Go, and TypeScript
• Provided bilingual documentation (Chinese and English) with problem description, examples, constraints, and solution explanations

Reviewed changes

Copilot reviewed 15 out of 15 changed files in this pull request and generated no comments.

Show a summary per file

File	Description
Solution.py	Binary search approach to find maximum valid subarray length
Solution.java	Binary search implementation with overflow protection
Solution.cpp	C++ implementation using ranges and upper_bound
Solution.go	Go implementation with int64 conversions for overflow safety
Solution.ts	TypeScript implementation using lodash sortedIndexBy
Solution2.py	Two-pointer sliding window approach
Solution2.java	Java two-pointer with explicit long cast
Solution2.cpp	C++ two-pointer with long long cast
Solution2.go	Go two-pointer implementation
Solution2.ts	TypeScript two-pointer approach
README.md	Chinese documentation with problem and solution details
README_EN.md	English documentation with problem and solution details

---

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.