Repository navigation
v0.6.2
Added
Complete coverage of the current LeetCode CN Hot 100 study plan: 100/100 problems, with 249 problems in the pack overall.
- 0031 — Next Permutation
- 0034 — Find First and Last Position of Element in Sorted Array
- 0114 — Flatten Binary Tree to Linked List
- 0148 — Sort List
- 0160 — Intersection of Two Linked Lists
- 0189 — Rotate Array
- 0236 — Lowest Common Ancestor of a Binary Tree
- 0283 — Move Zeroes
- 0438 — Find All Anagrams in a String
All nine include official English and Chinese statements, Go and Python reference solutions, topic grouping, and 306 total cases (including deterministic inputs near constraint limits).
Validation and compatibility
- Whole-pack checks pass with CI-pinned hc v0.1.0-alpha.13.
- Two incorrect implementations per new problem were rejected; generated inputs were checked against the statement constraints.
- No problems removed, signatures changed, or breaking changes introduced. Pack protocol remains 1.
- Minimum hc version remains v0.1.0-alpha.11, with Python 3.12+; Go references support Go 1.22+.
- Special node-reference encodings for 160 and 236 are documented in the English hc notes; Chinese statements remain as fetched from LeetCode.
Version v0.6.2 is published at the maintainer's explicit request for this addition batch.
What's Changed
New problems
- feat: complete LeetCode Hot 100 coverage by @MorePeanuts in #89
Full Changelog: v0.6.1...v0.6.2