Recuento de elementos que son iguales al XOR de los siguientes dos elementos

Dada una array arr[] de n elementos. La tarea es encontrar el conteo de elementos que son iguales al XOR de los siguientes dos elementos.
Ejemplos: 
 

Entrada: arr[] = {4, 2, 1, 3, 7, 8} 
Salida: 1 
2 es el único elemento válido ya que 1 ^ 3 = 2
Entrada: arr[] = {23, 1, 7, 8, 6 } 
Salida: 0 
 

Enfoque: Inicialice count = 0 y para cada elemento de la array de modo que tenga al menos dos elementos que aparezcan después de él en la array, si es igual al XOR de los siguientes dos elementos, entonces incremente la cuenta .
A continuación se muestra la implementación del enfoque anterior: 
 

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the count of elements
// which are equal to the XOR
// of the next two elements
int cntElements(int arr[], int n)
{
 
    // To store the required count
    int cnt = 0;
 
    // For every element of the array such that
    // it has at least two elements appearing
    // after it in the array
    for (int i = 0; i < n - 2; i++) {
 
        // If current element is equal to the XOR
        // of the next two elements in the array
        if (arr[i] == (arr[i + 1] ^ arr[i + 2])) {
            cnt++;
        }
    }
 
    return cnt;
}
 
// Driver code
int main()
{
    int arr[] = { 4, 2, 1, 3, 7, 8 };
    int n = sizeof(arr) / sizeof(int);
 
    cout << cntElements(arr, n);
 
    return 0;
}

// Java implementation of the approach
import java.io.*;
 
class GFG
{
     
// Function to return the count of elements
// which are equal to the XOR
// of the next two elements
static int cntElements(int arr[], int n)
{
 
    // To store the required count
    int cnt = 0;
 
    // For every element of the array such that
    // it has at least two elements appearing
    // after it in the array
    for (int i = 0; i < n - 2; i++)
    {
 
        // If current element is equal to the XOR
        // of the next two elements in the array
        if (arr[i] == (arr[i + 1] ^ arr[i + 2]))
        {
            cnt++;
        }
    }
    return cnt;
}
 
// Driver code
public static void main (String[] args)
{
    int arr[] = { 4, 2, 1, 3, 7, 8 };
    int n = arr.length;
 
    System.out.println (cntElements(arr, n));
}
}
 
// This code is contributed by jit_t

# Python3 implementation of the approach
 
# Function to return the count of elements
# which are equal to the XOR
# of the next two elements
def cntElements(arr, n):
 
    # To store the required count
    cnt = 0
 
    # For every element of the array such that
    # it has at least two elements appearing
    # after it in the array
    for i in range(n - 2):
 
        # If current element is equal to the XOR
        # of the next two elements in the array
        if (arr[i] == (arr[i + 1] ^ arr[i + 2])):
            cnt += 1
 
    return cnt
 
# Driver code
arr = [4, 2, 1, 3, 7, 8]
n = len(arr)
 
print(cntElements(arr, n))
 
# This code is contributed by Mohit Kumar

// C# implementation of the approach
using System;
using System.Collections.Generic;
     
class GFG
{
     
// Function to return the count of elements
// which are equal to the XOR
// of the next two elements
static int cntElements(int []arr, int n)
{
 
    // To store the required count
    int cnt = 0;
 
    // For every element of the array such that
    // it has at least two elements appearing
    // after it in the array
    for (int i = 0; i < n - 2; i++)
    {
 
        // If current element is equal to the XOR
        // of the next two elements in the array
        if (arr[i] == (arr[i + 1] ^ arr[i + 2]))
        {
            cnt++;
        }
    }
    return cnt;
}
 
// Driver code
public static void Main (String[] args)
{
    int []arr = { 4, 2, 1, 3, 7, 8 };
    int n = arr.Length;
 
    Console.WriteLine(cntElements(arr, n));
}
}
     
// This code is contributed by Rajput-Ji

<script>
 
// Javascript implementation of the approach
 
// Function to return the count of elements
// which are equal to the XOR
// of the next two elements
function cntElements(arr, n)
{
 
    // To store the required count
    let cnt = 0;
 
    // For every element of the array such that
    // it has at least two elements appearing
    // after it in the array
    for (let i = 0; i < n - 2; i++) {
 
        // If current element is equal to the XOR
        // of the next two elements in the array
        if (arr[i] == (arr[i + 1] ^ arr[i + 2]))
        {
            cnt++;
        }
    }
 
    return cnt;
}
 
// Driver code
    let arr = [ 4, 2, 1, 3, 7, 8 ];
    let n = arr.length;
 
    document.write(cntElements(arr, n));
 
</script>

1