# Bitwise ORs Of Subarrays: Walkthrough
Bitwise ORs Of Subarrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Maintain the set of OR-results of subarrays ending at i. Each new A[i] produces {prev | A[i]} union {A[i]}. The set size is O(32) because OR only turns bits on. Union everything into a global answer set.
## 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 * 32).
## Common mistake
Computing the OR of every L,R pair in O(n^2).
## 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 try it free.