Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Phone Screen: Two classic leetcode problems in the Top 30 list. One tests binary search in a sorted array, another one tests graph search using Breath First Search or Depth First Search algorithm
Coding
- Sort a list of input letters where there is only a subset of possible letters from the alphabet (as in 3-4 different letters, but many instances).
Coding
- All People Report to the Given Manager
Coding
- Array With Elements Not Equal to Average of Neighbors
Coding
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 1452. People Whose List of Favorite Companies Is Not a Subset of Another List
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source