Leetcode 2518. Number of Great Partitions

Count the number of ways to assign each element to one of two ordered groups so both group sums are at least k (mod 1e9+7). Key trick: instead of enumerating partitions, subtract assignments where a group's sum < k by counting subsets with sum < k using a knapsack/subset-sum DP (k ≤ 1000).