Available question text
Given a set of 2D points, find the smallest number of straight lines needed so that every point lies on at least one line; the core challenge is identifying collinear groups and selecting a minimum collection of those lines (a geometric set-cover), typically approached by enumerating lines from point pairs and using combinatorial/bitmask DP or greedy strategies depending on constraints.
Related questions
Continue with questions that share topics or the same question type.
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 2152. Minimum Number of Lines to Cover Points
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source