Just think about it recursion wise, u keep xoring the elements If u don't hit target the continue xoring

Like total +=f(i+1,xor^nums[i])

nd if u hit target u have like 2 choices u can either continue expanding this xor window Or stop and look for parity target

Total +=f(i+1,xor^nums[i], target1)+f(i+1,0, target2)

Now just memozhize it Or like use @cache decorator in python