# Count Triplets That Can Form Two Arrays Of Equal XOR: Interview Notes
Count Triplets That Can Form Two Arrays Of Equal XOR shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
We need i < j <= k such that xor[i..j-1] == xor[j..k], which is equivalent to xor[i..k] == 0. For each k count how many earlier prefixes equal prefix[k+1]; each such i contributes (k-i) values of j.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Enumerating every i, j, k.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI copilot.