Leetcode 1452. People Whose List of Favorite Companies Is Not a Subset of Another List

Given an array of each person's favorite-company lists, return the indices (in increasing order) of lists that are not a subset of any other list — i.e., find which lists are not fully contained within another person's list. The core challenge is efficient set-inclusion checking across up to 100 lists (each up to 500 companies).