Available question text
Determine if nums can be split into two non-empty subsets with the same average — equivalently, check whether there exists a subset of size k (1 ≤ k < n) whose sum equals k * total_sum / n. This reduces to a size-constrained subset-sum problem (solvable via DP or meet-in-the-middle given n ≤ 30).
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 805. Split Array With Same Average
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source