feat: add solutions to lc problem:s No.3766, 3767

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds solutions for LeetCode problem #3766 "Minimum Operations to Make Binary Palindrome" from Biweekly Contest 171. The problem requires finding the minimum number of increment/decrement operations to transform each number in an array into a binary palindrome (a number whose binary representation reads the same forwards and backwards).

• Implements a preprocessing + binary search solution that precomputes all binary palindromic numbers in range [0, 2^14)
• Provides solutions in 5 programming languages: Python, Java, C++, Go, and TypeScript
• Includes comprehensive documentation in both Chinese and English with examples and complexity analysis

Reviewed changes

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

Show a summary per file

File	Description
Solution.py	Python implementation using bisect for binary search on precomputed palindromes
Solution.java	Java implementation with custom binary search method
Solution.cpp	C++ implementation using STL lower_bound and bitset for binary conversion
Solution.go	Go implementation with helper function for palindrome checking
Solution.ts	TypeScript implementation using lodash's sortedIndex
README.md	Chinese problem description, examples, constraints, and solution explanation
README_EN.md	English problem description, examples, constraints, and solution explanation
CONTEST_README.md	Updates contest listing to include problem 3766
CONTEST_README_EN.md	Updates English contest listing to include problem 3766
README.md (solution/)	Adds problem 3766 entry to the main problem index
README_EN.md (solution/)	Adds problem 3766 entry to the English problem index

---

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