| # | Title | Difficulty | Tag | Time, ms | Time, %

|------|----------------|-------------|-------------|----------|---------

| 2317 |[Maximum XOR After Operations](src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java)| Medium || 1 | 100.00

| 2316 |[Count Unreachable Pairs of Nodes in an Undirected Graph](src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java)| Medium || 32 | 100.00

| 2315 |[Count Asterisks](src/main/java/g2301_2400/s2315_count_asterisks/Solution.java)| Easy || 1 | 100.00

| 2312 |[Selling Pieces of Wood](src/main/java/g2301_2400/s2312_selling_pieces_of_wood/Solution.java)| Hard | Backtracking | 78 | 63.64

packageg2301_2400.s2317_maximum_xor_after_operations;

publicclassSolution {

publicintmaximumXOR(int[]nums) {

intmax =0;

for (intn :nums) {

max |=n;

}

returnmax;

}

}

2317\. Maximum XOR After Operations

Medium

You are given a**0-indexed** integer array`nums`. In one operation, select**any** non-negative integer`x` and an index`i`, then**update**`nums[i]` to be equal to`nums[i] AND (nums[i] XOR x)`.

Note that`AND` is the bitwise AND operation and`XOR` is the bitwise XOR operation.

Return_the**maximum** possible bitwise XOR of all elements of_`nums`_after applying the operation**any number** of times_.

**Example 1:**

**Input:** nums =[3,2,4,6]

**Output:** 7

**Explanation:** Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.

Now, nums =[3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.

It can be shown that 7 is the maximum possible bitwise XOR.

Note that other operations may be used to achieve a bitwise XOR of 7.

**Example 2:**

**Input:** nums =[1,2,3,9,2]

**Output:** 11

**Explanation:** Apply the operation zero times.

The bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.

It can be shown that 11 is the maximum possible bitwise XOR.

**Constraints:**

* <code>1 <= nums.length <= 10⁵</code>

* <code>0 <= nums[i] <= 10⁸</code>

packageg2301_2400.s2317_maximum_xor_after_operations;

importstaticorg.hamcrest.CoreMatchers.equalTo;

importstaticorg.hamcrest.MatcherAssert.assertThat;

importorg.junit.jupiter.api.Test;

classSolutionTest {

voidmaximumXOR() {

assertThat(newSolution().maximumXOR(newint[] {3,2,4,6}),equalTo(7));

}

voidmaximumXOR2() {

assertThat(newSolution().maximumXOR(newint[] {1,2,3,9,2}),equalTo(11));

}

}