Leetcode 805. Split Array With Same Average

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 805. Split Array With Same Average

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact