Day 94 of 100 days dsa coding challenge

Taking on a new challenge: solving GeeksforGeeks POTD daily and sharing my solutions! 💻🔥
The goal: sharpen problem-solving skills, level up coding, and learn something new every day. Follow my journey! 🚀

100DaysOfCode #CodingChallenge #ProblemSolving #GeeksforGeeks #DeveloperJourney

Problem:

https://www.geeksforgeeks.org/problems/max-xor-subarray-of-size-k/1

Max Xor Subarray of size K

Difficulty: Medium Accuracy: 70.74%

Given an array of integers arr[] and a number k. Return the maximum xor of a subarray of size k.
Note: A subarray is a contiguous part of any given array.

Examples:
Input: arr[] = [2, 5, 8, 1, 1, 3], k = 3
Output: 15
Explanation: arr[0] ^ arr[1] ^ arr[2] = 15, which is maximum.
Input: arr[] = [1, 2, 4, 5, 6] , k = 2
Output: 6
Explanation: arr[1] ^ arr[2] = 6, which is maximum.
Constraints:
1 ≤ arr.size() ≤ 106
0 ≤ arr[i] ≤ 106
1 ≤ k ≤ arr.size()

Solution:
class Solution:
def maxSubarrayXOR(self, arr, k):
n = len(arr)
xr = 0
for i in range(k):
xr ^= arr[i]
ans = xr
for i in range(k, n):
xr ^= arr[i-k]
xr ^= arr[i]
ans = max(ans, xr)
return ans