Repository navigation
v0.4.3
Adds five LeetCode problems, bringing the pack to 88 problems:
- 0094 Binary Tree Inorder Traversal
- 0111 Minimum Depth of Binary Tree
- 0144 Binary Tree Preorder Traversal
- 0373 Find K Pairs with Smallest Sums
- 0378 Kth Smallest Element in a Sorted Matrix
All five include official English and Chinese statements, Go/Python templates and references, and topic-group entries. The new problems contain 164 cases: 14 statement examples, 132 small regressions, and 18 generated cases. Problem 373 accepts all valid optimal pair selections, including ties and repeated values.
Validation: hc pack check passes all 88 problems with CI-pinned hc v0.1.0-alpha.11. Independent oracle checks and 11 incorrect-implementation mutation checks passed. The brute-force Cartesian-product solution for 373 exceeds the time limit; standard heap and binary-search solutions for 378 pass. Auxiliary-space usage and the traversal problems' iterative follow-up are not automatically enforced.
Requires hc v0.1.0-alpha.11 or later and Python 3.12 or later. Protocol remains 1. No problems removed and no breaking changes.
What's Changed
New problems
- feat: add tree and heap exercises by @MorePeanuts in #36
Full Changelog: v0.4.2...v0.4.3