OpenGenus/cosmos

Implementing Subarray with given XOR

Open

#6,480 opened on Oct 4, 2022

View on GitHub
 (4 comments) (0 reactions) (1 assignee)C++ (3,724 forks)batch import
Hacktoberfest

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

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.

Contributor guide

Research direction
Tech stack
Domain
Issue type
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Prerequisites
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.