OpenGenus/cosmos

Implementing Subarray with given XOR

Open

#6,480 opened on 2022年10月4日

GitHub で見る
 (4 comments) (0 reactions) (1 assignee)C++ (3,724 forks)batch import
Hacktoberfest

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (30d に merged PR はありません)

説明

This is a(n):

  • New algorithm
  • Update to an existing algorithm
  • Error
  • Proposal to the Repository

Details:

This is a very famous and important problem in bit_manupulation concept.

About Problem:

Given an array of integers A and an integer B. Find the total number of subarrays having bitwise XOR of all elements equals to B.

コントリビューターガイド