# Maximum Total Reward Using Operations II (LeetCode 4127)
Interview drill note.
## Approach
Prefix sums / running XOR keep subarray queries O(1) after O(n) prep.
## Complexity
State time and space clearly; call out edge cases (empty input, duplicates, extremes).
## Practice tip
Rehearse the explanation out loud. An [www.linkjob.ai](https://www.linkjob.ai/) helps keep structure under time pressure.
## Notes (r0058)
Disclosure: personal study notes; I am affiliated with Linkjob AI.