Add Sliding Window XOR algorithm in C++ with test cases#3023
Add Sliding Window XOR algorithm in C++ with test cases#3023DataWorshipper wants to merge 7 commits intoTheAlgorithms:masterfrom
Conversation
DataWorshipper
requested review from
Panquesito7 and
realstealthninja
as code owners
| #include <cassert> /// for assert | ||
| #include <cstdint> | ||
| #include <iostream> /// for IO operations | ||
| #include <vector> |
There was a problem hiding this comment.
| #include <vector> | |
| #include <vector> /// for std::vector |
| * @param a Multiplier in array generation | ||
| * @param b Increment in array generation | ||
| * @param c Modulo in array generation |
There was a problem hiding this comment.
These variable names could be longer.
There was a problem hiding this comment.
These variables were in the problem statement ,i think it would be intuitive for the user who is following the problem statement
| std::uint64_t l = 0; // Left pointer of sliding window | ||
| std::uint64_t r = 0; // Right pointer of sliding window |
There was a problem hiding this comment.
Could name these to be left and right, respectively.
Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>
|
Hello ,so i have refactored the variable names and added the changes that you requested ,could you take a look at it now |
|
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
github-actions
Bot
added
the
stale
|
Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions! |
2 participants
Description of Change
This pull request adds a C++ implementation of the Sliding Window XOR problem to the Bit Manipulation section.
The algorithm calculates the bitwise XOR of every window of size
kin an array ofnintegers generated using the recurrence relation:It maintains a sliding window of size k using two pointers, efficiently computing the cumulative XOR of all windows in O(n) time with O(n) space.
The submission is self-contained, with detailed Doxygen documentation and a test() function that includes multiple verified test cases to ensure correctness.
Checklist