Leetcode 3323. Minimize Connected Groups by Inserting Interval

Given a set of intervals on the number line, determine where to insert one additional interval (often of fixed length) to maximally connect/merge existing intervals so the final number of connected groups is minimized. This requires reasoning about interval merging and gap-bridging — typically solved with merged-component identification plus sweep/ sliding-window to find the optimal insertion that bridges the most gaps.