Implement Calendar Layout and String Packing

Part 1: Minimal Column Layout via Sweep-Line with Min-Heap The central challenge is to assign each event to the fewest possible columns while ensuring that overlapping events never share a column. The key observation is that within any maximal cluster of events linked by overlaps (an overlapping group), the minimum required number of columns equals the peak number of simultaneously active events in that cluster. In interval scheduling terms, this is the maximum concurrency.…