Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Count Connected Friend Groups
Coding · Graphs
- A Leetcode Medium Interval algorithm derivative
Coding
- Alternating Groups I
Coding
- Alternating Groups II
Coding · Array · Sliding Window
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3323. Minimize Connected Groups by Inserting Interval
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source