Leetcode 2152. Minimum Number of Lines to Cover Points

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.