Search lands in PR-5.1 (Pagefind).

Data Structures & Algorithms

Greedy Combine

Repeatedly extract the two smallest, combine, and reinsert — Huffman-style accumulation.

  1. Problem 01 Connect Ropes with Minimum Cost Min-heap of lengths; always merge the two smallest. 6 min