Skip to content

v0.5.1

Choose a tag to compare

@MorePeanuts MorePeanuts released this 13 Nov 07:03

Topic groups

  • Add queue with Sliding Window Maximum (239).
  • Add design with 12 existing data structure design problems.
  • Add divide-and-conquer with Merge k Sorted Lists (23), Construct Binary Tree from Preorder and Inorder Traversal (105), and Sort an Array (912).
  • Add randomized as an empty group for future randomized exercises.
  • Prefer a problem's primary topic and retain multiple memberships only when it clearly belongs to multiple topics. Prefix sums and difference arrays use arrays-hashing; monotonic stacks use stack.

Existing group order and memberships are preserved. The pack still contains 155 problems; no problem statements, signatures, references, cases, or judge rules changed in this release.

Authoring and CI

  • Upgrade the pinned hc version from v0.1.0-alpha.11 to v0.1.0-alpha.13 and refresh the bundled Codex and Claude skills (#82).
  • Add the topic groups and contributor guidance described above (#84).

Compatibility

  • Protocol remains 1; the minimum supported reader remains hc v0.1.0-alpha.11. Authoring skills and CI now use hc v0.1.0-alpha.13.
  • Go and Python support and the official English and Chinese statements are unchanged.
  • No breaking changes or migration steps.

Validation

  • hc pack check: all 155 problems pass with hc v0.1.0-alpha.13.
  • The grouping PR and the release commit pass repository CI.

Full changelog: v0.5.0...v0.5.1