AdditionPrinciple
Exeter
Basic
2015
Let $S$ be the string $0101010101010$. Determine the number of substrings containing an odd number of $1$'s. (A substring is defined by a pair of (not necessarily distinct) characters of the string and represents the characters between, inclusively, the two elements of the string.)
The solution for this problem is available for
$0.99.
You can also purchase a pass for all available solutions for
$99.