Package g2301_2400.s2354_number_of_excellent_pairs

Class Solution

java.lang.Object

g2301_2400.s2354_number_of_excellent_pairs.Solution

public class Solution
extends Object

2354 - Number of Excellent Pairs.<p>Hard</p> <p>You are given a <strong>0-indexed</strong> positive integer array <code>nums</code> and a positive integer <code>k</code>.</p> <p>A pair of numbers <code>(num1, num2)</code> is called <strong>excellent</strong> if the following conditions are satisfied:</p> <ul> <li><strong>Both</strong> the numbers <code>num1</code> and <code>num2</code> exist in the array <code>nums</code>.</li> <li>The sum of the number of set bits in <code>num1 OR num2</code> and <code>num1 AND num2</code> is greater than or equal to <code>k</code>, where <code>OR</code> is the bitwise <strong>OR</strong> operation and <code>AND</code> is the bitwise <strong>AND</strong> operation.</li> </ul> <p>Return <em>the number of <strong>distinct</strong> excellent pairs</em>.</p> <p>Two pairs <code>(a, b)</code> and <code>(c, d)</code> are considered distinct if either <code>a != c</code> or <code>b != d</code>. For example, <code>(1, 2)</code> and <code>(2, 1)</code> are distinct.</p> <p><strong>Note</strong> that a pair <code>(num1, num2)</code> such that <code>num1 == num2</code> can also be excellent if you have at least <strong>one</strong> occurrence of <code>num1</code> in the array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,1], k = 3</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> The excellent pairs are the following:</p> <ul> <li> <p>(3, 3). (3 AND 3) and (3 OR 3) are both equal to (11) in binary. The total number of set bits is 2 + 2 = 4, which is greater than or equal to k = 3.</p> </li> <li> <p>(2, 3) and (3, 2). (2 AND 3) is equal to (10) in binary, and (2 OR 3) is equal to (11) in binary. The total number of set bits is 1 + 2 = 3.</p> </li> <li> <p>(1, 3) and (3, 1). (1 AND 3) is equal to (01) in binary, and (1 OR 3) is equal to (11) in binary. The total number of set bits is 1 + 2 = 3.</p> </li> </ul> <p>So the number of excellent pairs is 5.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [5,1,1], k = 10</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> There are no excellent pairs for this array.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>1 <= nums[i] <= 10⁹</code></li> <li><code>1 <= k <= 60</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
long	countExcellentPairs(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

countExcellentPairs

public long countExcellentPairs(int[] nums,
 int k)