112113114115116117
class Node {
    constructor() {
        this.links = [null, null];
    }

    /*To check if a specific 
    bit key is present in 
    the child nodes*/
    containsKey(bit) {
        return this.links[bit] !== null;
    }

   /* To get the child 
   node corresponding 
   to a specific bit*/
    get(bit) {
        return this.links[bit];
    }

    /*To set a child node 
    at a specific index 
    in the links array*/
    put(bit, node) {
        this.links[bit] = node;
    }
}

// Trie class
class Trie {
    constructor() {
        this.root = new Node();
    }

    // To insert number in Trie
    insert(num) {
        // Start from the root
        let node = this.root;
        // Iterate each bit
        for (let i = 31; i >= 0; i--) {
            // Extract i-th bit
            const bit = (num >> i) & 1;
            /* If the current node doesn't 
           have a child node with the 
           current bit */
            if (!node.containsKey(bit)) {
                node.put(bit, new Node());
            }
            node = node.get(bit);
        }
    }

    // Method to find the maximum XOR 
    getMax(num) {
        // Start from root
        let node = this.root;
        // Initialize maximum XOR value
        let maxNum = 0;
        // Iterate each bit
        for (let i = 31; i >= 0; i--) {
            // Extract the i-th bit 
            const bit = (num >> i) & 1;
            /*If the complement of the current bit 
            exists in the Trie update the maximum 
            XOR value with the current bit
            move to the child node corresponding to 
            the complement of the current bit
            Else move to the child node 
            corresponding to the current bit */
            if (node.containsKey(1 - bit)) {
                maxNum |= (1 << i);
                node = node.get(1 - bit);
            } else {
                node = node.get(bit);
            }
        }
        // Return maximum XOR
        return maxNum;
    }
}

// Solution class
class Solution {
    findMaximumXOR(nums) {
        // Create Trie
        const trie = new Trie();
        // Insert number
        for (const num of nums) {
            trie.insert(num);
        }

        // Maximum XOR value
        let maxi = 0;

        // Iterate each number
        for (const num of nums) {
            // Update the maximum XOR
            maxi = Math.max(maxi, trie.getMax(num));
        }

        // Return maximum XOR value
        return maxi;
    }
}

// Main function
const solution = new Solution();

// Test case
const nums = [3, 10, 5, 25, 2, 8];

// Print the input array
console.log("Input:", nums.join(" "));

// Find and print the maximum XOR value
const result = solution.findMaximumXOR(nums);
console.log("Maximum XOR value:", result);
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656