Add Sliding_Window_XOR working solution #13129
Open
Add this suggestion to a batch that can be applied as a single commit. This suggestion is invalid because no changes were made to the code. Suggestions cannot be applied while the pull request is closed. Suggestions cannot be applied while viewing a subset of changes. Only one suggestion per line can be applied in a batch. Add this suggestion to a batch that can be applied as a single commit. Applying suggestions on deleted lines is not supported. You must change the existing code in this line in order to create a valid suggestion. Outdated suggestions cannot be applied. This suggestion has been applied or marked resolved. Suggestions cannot be applied from pending reviews. Suggestions cannot be applied on multi-line comments. Suggestions cannot be applied while the pull request is queued to merge. Suggestion cannot be applied right now. Please check back later.
Description of Change
This pull request adds a Python implementation of the Sliding Window XOR problem to the Bit Manipulation section.
The algorithm calculates the bitwise XOR of every window of size
k
in an array ofn
integers 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 docstrings, a class-based interface (SlidingWindowXOR), and a main section that runs multiple verified test cases to ensure correctness.
Checklist: