DSA Level 2 Data Structures Trie Count Pairs With Xor In A Range

Count Pairs With Xor In A Range

medium

Given an integer array nums and two integers low and high.
Count number of pairs of indexes (i, j) for which both of this expression's are satisfied:
1. 0 &lt;= i &lt; j &lt; nums.length
2. low &lt;= nums[i] ^ nums[j] &lt;= high

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

1. 1 &lt;= nums.length &lt;= 2 * 10^4
2. 1 &lt;= nums[i] &lt;= 2 * 10^4
3. 1 &lt;= low &lt;= high &lt;= 2 * 10^4

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

Stream Of Characters

Replace Words