Leetcode 2638. Count the Number of K-Free Subsets

Count the number of subsets of a multiset of integers such that no two chosen elements differ by k. The challenge is to handle duplicate values and large counts efficiently by grouping values and computing independent-set counts over the graph of values connected by edges for difference k (with the result usually asked modulo 10^9+7).