Implementing Subarray with given XOR
tanuj1811 opened this issue · comments
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.
I think I can help in this issue.
@AdiChat, I would really appreciate it if you could assign me this issue with Hacktoberfest tag so that can I can start contributing to this repo.
Thank you and have a great Hacktoberfest.
Plz can you assign this to me
Hey @AdiChat ,
Can you please review my PR and approved it fast
Thank you
Hey @AdiChat Can you please assign this task to me