Ixigo | 1st nov 2025 | 1 Nov, 2025 | Arthur's Knights Subset Sums

Problem Description: Arthur and the Knights Problem Statement: The knights choose a subset of soldiers from an array such that the total number of soldiers in their chosen subset is exactly K. Arthur can then choose a subset from the knights' chosen subset. Find all unique sums of soldiers that Arthur can make, provided that the sum of his chosen subset is less than or equal to X. Note: A subset of an array A is a collection of some ...