Sum of all consecutive-step subarrays
Call a subarray consecutive when each element is exactly one more than the one before it, or each is exactly one less (a single element counts). Return the sum of the values of all consecutive subarrays of an integer array, modulo a large prime. Aim for linear time.
No answer yet. Write the first one; the best answer gets endorsed.
