Almost every array problem starts by visiting each element once: finding the maximum, summing, counting, or reading input. Traversal is that single O(n) pass, and getting it right means no off-by-one errors at the ends. Use it whenever the answer needs a look at every element, like the second largest value. If you find yourself traversing the array again for each element, look for a smarter single pass instead.