Counting Beautiful Subsets In An Array With Given Difference
Counting beautiful subsets in an array where no two elements differ by k is key. Algorithm uses DFS and dynamic counting to find all possible subsets, returning their count.
2597. The Number of Beautiful Subsets Medium You are given an array nums of positive integers and a positive integer k. A subset of nums is beautiful if it does not contain two integers with an absolute difference equal to k. Return the number of non-empty beautiful subsets of the array nums. A subset of nums is an array that can be obtained by deleting some (possibly none) elements from nums. Two subsets are different if and only if the chosen indices to delete are different. Example 1: Input: nums = [2,4,6], k = 2 Output: 4 Explanation: The beautiful subsets of the array nums are: [2], [4],...