Leetcode 2397. Maximum Rows Covered by Columns

Given an m×n binary matrix and an integer numSelect, choose exactly numSelect columns to maximize the number of rows whose 1s are all contained within the selected columns (rows with no 1s are automatically covered). With m,n ≤ 12, this problem is typically solved by enumerating column subsets or using bitmask-based checks to count covered rows.