The Number of Beautiful Subsets at Infosys

Problem Description

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...

Topics

Also asked at 3 companies