Leetcode 2597. The Number of Beautiful Subsets

Count the number of non-empty subsets (indices distinct) of nums such that no two chosen elements have absolute difference exactly k. With n ≤ 18 this is a combinatorial counting problem under pairwise conflict constraints, often tackled by exploring subsets/backtracking or by exploiting independent groups formed by values with the same remainder modulo k.