Search
⌘K
Leetcode 1524. Number of Sub-arrays With Odd Sum
Count how many subarrays of an integer array have an odd sum; because n can be up to 1e5, this requires an O(n) approach using parity counts of prefix sums to compute pairings and return the result modulo 10^9+7.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.