### gabrielwu's blog

By gabrielwu, history, 4 months ago,

(You can find a slightly different version of this article, tailored more for a non-CP audience, on my website.)

Thank you to smax for his feedback on this post.

Prerequisites:

• expected value, linearity of expectation
• basic linear algebra
• familiarity with string algorithms such as KMP (only in certain sections)

## The Problem

Say you're given a string of coin flips, such as HTTH or TTTHHT. What is the expected number of times you must flip a coin until you encounter that string?

A common initial (incorrect) intuition about this problem is that all strings of length $n$ should have the same answer -- something like $2^n$. We sense that there should be some sort of symmetry between heads and tails, so it feels odd that HHHH should appear any earlier or later than HTHT. But in this case, our intuition is simply wrong. It is true that the answer will always be on the order of $2^n$ (specifically, bounded between $2^{n}$ and $2^{n+1}-2$), but the string itself does matter, as we shall see.

Let's consider a simple example. How many coins do you need to flip before getting a H? For this particular string, the number of flips you need creates the Bernoulli distribution, which has an expected value of $2$. One slick way to see this is to imagine computing the answer by conducting many consecutive "trials" by flipping the coin a large number of times (say you do $N = 10^9$ total flips). The total number of trials you end up completing is simply the number of heads you encounter, which should be close to $N/2$. And since the expected number of flips per trial is approximated by the average number of flips over a large number of trials, our answer is $\frac{N}{N/2} = 2$. While this method of considering a large number of consecutive trials works well for the string H, we will need to find a more general method for longer strings.

(why?)

## States

The solution is to use states, a technique common to expected value problems. The idea of states is simple: define a bunch of variables to represent different stages of progress towards a goal. Create relations among the variables corresponding to "transitions" from one state to another, then solve the system of (usually) linear equations for the answer. In our case, when given string $S$ of length $n$, we will use $n+1$ state variables: $e_0, e_1, \dots, e_n$. The variable $e_i$ will represent the expected number of additional flips required to obtain string $S$ given that we've just flipped the first $i$ characters of $S$. By definition, $e_n$ represents the expected number of flips to obtain $S$ if we've already flipped all of $S$, so $e_n = 0$. Our final answer will be $e_0$ (because we start out with nothing flipped).

Formally, what we're doing here is a creating "state function" $f: \{\text{H}, \text{T}\}^* \to \{0, 1, \dots, n\}$ that maps every possible string of coin flips to a unique state in $\{0, 1, \dots, n\}$. In this case, our state function $f$ takes in a string $s$ and outputs the largest nonnegative integer $i$ such that $|s| \geq i$ and the last $i$ characters of $s$ are the first $i$ characters of $S$ (note the difference between $s$ and $S$ -- little $s$ is the input to $f$, while big $S$ is our target string which acts as a global variable). For example, if $S$ is HTHH, then the empty string gets assigned state $0$, HHT gets state $2$, HHHTHTH gets state $3$, and THTHH gets state $4$.

If you're interested in some more formality...

On a more intuitive level, what we're doing is finding a way to compress the infinite set of coin flip strings into a finite set of states. We do this in a way that preserves all relevant information to the number of coin flips needed to get accepted, including how likely it is to transition from one state to another. This will allow us to build a finite system of equations (as opposed to an infinite system of equations) that we can solve to find the answer.

So what exactly is this system of equations? Take the example in which $S$ is HTHH. For each state we have an equation that relates its expected value to the expected values of the states it can transition to. If we currently have the first $0$ characters of $S$ (which would correspond to flip sequences such as the empty string, or TTT, or HTHTT), then if we flip an H next we will end up in state $1$. But if we flip a T next, we will remain in state $0$. By linearity of expectation, this lets us write the equation $e_0 = 1 + \frac{1}{2}e_1 + \frac{1}{2}e_0$. Similarly, if we currently are in state $1$, then flipping a H will keep us in state $1$, while flipping a T will transition us to state $2$. So $e_1 = 1 + \frac{1}{2}e_1 + \frac{1}{2}e_2$. Continuing this process, we get the following equations:

State New state (H flipped) New state (T flipped) Equation
$0$ (...) $1$ (...H) $0$ (...T) $e_0 = 1 + \frac{1}{2}e_1 + \frac{1}{2}e_0$
$1$ (...H) $1$ (...HH) $2$ (...HT) $e_1 = 1 + \frac{1}{2}e_1 + \frac{1}{2}e_2$
$2$ (...HT) $3$ (...HTH) $0$ (...HTT) $e_2 = 1 + \frac{1}{2}e_3 + \frac{1}{2}e_0$
$3$ (...HTH) $4$ (...HTHH) $2$ (...HTHT) $e_3 = 1 + \frac{1}{2}e_4 + \frac{1}{2}e_2$
$4$ (...HTHH) n/a n/a $e_4 = 0$

Now we can solve this system of four equations and four unknowns with our favorite linear system technique (for example, Gaussian elimination). In the end, we get $e_0 = 18$, which is our final answer to the question "What is the expected number of coin flips I need to perform before encountering HTHH?"

For a general string $S$, how do we systematically generate these equations? Each of these equations comes in the form $e_i = 1 + \frac{1}{2}e_j + \frac{1}{2}e_k$. In particular, for a given state $i$, we get that $j$ is the state of the string $S_{0\dots i-1}$ H (i.e. the first $i$ characters of $S$ followed by a H), while $k$ is the state of $S_{0\dots i-1}$ T.

This suffices as a complete algorithm to calculate the answer for any given string $S$. First, generate the $n$ equations by computing the states of the appropriate strings. Then, solve the system of equations for $e_0$. In the next section, I will analyze the time complexity of this algorithm and present two powerful optimizations to the naive strategy.

## Time complexity

Naively, we can compute the state of a string $s$ by checking if the $i$th suffix of $s$ is equal to the $i$th prefix of $S$ for all possible $i$. Each string comparison can be done in $O(n)$ and there are $O(n)$ possible $i$ values, so this takes $O(n^2)$ time. We will need to call this state function for each equation we generate, so it takes $O(n^3)$ time to generate all $n$ equations. Once we have these equations, Gaussian elimination takes an additional $O(n^3)$ time, so overall our naive algorithm has a cubic time complexity.

Technically, we must add on an extra factor of $n$ to account for computation using arbitrarily large numbers. The integer values encountered in this problem grow exponentially in $n$, so they can be $O(n)$ digits long. When the numbers are this big, even addition takes $O(n)$ time (and speicial BigInteger classes will have to be used in certain programming languages because the values will not fit into 64-bit words). But in this analysis I will treat the standard operations of addition and subtraction as taking only $O(1)$ time (perhaps we only need the answer modulo some large prime). This means I will omit the extra factor of $n$ in the time complexities.

Now that we have established a straightforward $O(n^3)$ algorithm, I will show how we can make this process much more efficient. The result will be linear-time ($O(n)$) algorithm. This optimization must affect both stages of the algorithm: we must be able to generate the $n$ equations in linear time, and we must be able to solve the resultant system in linear time.

## The Longest Prefix-Suffix (LPS) Array

As explained earlier, the problem of generating the $n$ equations reduces to computing the states of $S_{0\dots i-1}$ H and $S_{0\dots i-1}$ T for all $i$ from $0$ to $n-1$. For any given $i$, it is obvious which state $S_{0\dots i-1}S_i$ corresponds to: it's just state $i+1$. So the only question is what state the string $S_{0\dots i-1}\overline{S_i}$ corresponds to. To compute this efficiently, we will introduce the Longest Prefix-Suffix (LPS) array, which some readers may recognize as the cornerstone of the Knuth-Morris-Pratt (KMP) string searching algorithm. We define $LPS$ to be an integer array of length $n$, where $LPS[i]$ (for $0 \leq i \leq n-1$) represents the length of the longest proper prefix of $S_{0\dots i}$ that is also a suffix of $S_{0\dots i}$ (we will call this a proper prefix-suffix). For example, if $S =$ HHTHHTH, then $LPS = [0, 1, 0, 1, 2, 3, 4]$ because:

• H has length 1, so it has no positive-length proper prefix
• the first character of HH is the last character of HH
• there is no positive-length proper prefix of HHT that is also a suffix
• the first character of HHTH is the last character of HHTH
• the first two characters of HHTHH are the last two characters of HHTHH
• the first three characters of HHTHHT are the last three characters of HHTHHT
• the first four characters of HHTHHTH are the last four characters of HHTHHTH

In addition to $LPS$, we will have three more arrays of length $n$: $LIPS$, $LPSH$, and $LPST$. These arrays are not typically used in the KMP algorithm, but they are useful for solving this problem. We define them as follows. $LIPS[i]$ represents the length of the longest proper prefix-suffix of $S_{0\dots i-1}\overline{S_i}$ (the $I$ stands for "last character inverted"). $LPSH[i]$ represents the length of the longest proper prefix-suffix of $S_{0\dots i}$ that has H as the next character after the prefix, or $-1$ if this does not exist. In other words, for $LPSH[i] \neq -1$ we must have $S_{LPSH[i]} =$ H. Similarly, $LPST[i]$ represents the length of the longest proper prefix-suffix of $S_{0\dots i}$ that has T for the next character after the prefix, or $-1$ if this does not exist. In the example from above ($S =$ HHTHHTH), we have $LIPS = [0, 0, 2, 0, 0, 2, 0]$, $LPSH = [0, 1, 0, 1, 1, 3, 4]$, and $LPST = [-1, -1, -1, -1, 2, -1, -1]$.

It turns out that we can generate all four of these arrays in linear time using dynamic programming! Here's my C++ code:

Note
//initialize base cases
LIPS[0] = 0;
LPS[0] = 0;
if(S[0] == 'H'){
LPSH[0] = 0;
LPST[0] = -1;
} else {	// S[0] == 'T'
LPSH[0] = -1;
LPST[0] = 0;
}

for(int i=1; i<n; i++){

// set LPS[i] and LIPS[i]
if(S[i] == 'H'){
LPS[i] = LPSH[i-1] + 1;
LIPS[i] = LPST[i-1] + 1;
} else {	// S[i] == 'T'
LPS[i] = LPST[i-1] + 1;
LIPS[i] = LPSH[i-1] + 1;
}

// set LPSH[i] and LPST[i]
if(S[LPS[i]] == 'H'){
LPSH[i] = LPS[i];
LPST[i] = (LPS[i] > 0 ? LPST[LPS[i]-1] : -1);
} else {	// S[LPS[i]] == 'T'
LPST[i] = LPS[i];
LPSH[i] = (LPS[i] > 0 ? LPSH[LPS[i]-1] : -1);
}
}


Let's break down the transitions here. The first observation is that $LPS[i]$ must correspond to a prefix-suffix of $S_{0\dots i}$ that is one longer than a prefix-suffix of $S_{0\dots i-1}$. But it cannot extend just any prefix-suffix of $S_{0\dots i-1}$. It must extend one that agrees with $S_i$ on the next character. If $S_i =$ H, then this is exactly the prefix-suffix that $LPSH[i-1]$ represents, so we set $LPS[i] = LPSH[i-1] + 1$. Otherwise, we set $LPS[i] = LPST[i-1] + 1$. We can determine $LIPS[i]$ similarly -- just imagine $S_i$ is inverted and treat it like $LPS[i]$.

Now, without loss of generality, say that the longest prefix-suffix of $S_{0\dots i}$ has H as the next character after that prefix (the other case is handled symmetrically). Then we can simply set $LPSH[i]$ to be the same length as $LPS[i]$. We also know that $LPST[i]$ must be strictly smaller than $LPS[i]$, i.e. it must indicate the longest proper prefix-suffix of $S_{0\dots LPS[i]-1}$ that has a T as the next character (if this exists). But this is exactly what $LPST[LPS[i]-1]$ represents! This gives us $O(1)$ transitions for all four arrays.

Long story short, we can build the four arrays in linear time. How does this help us? Well, notice that the state of a string of the form $S_{0\dots i-1}\overline{S_i}$ is equal to its longest proper prefix-suffix. This is because its first $j \leq i$ characters are guaranteed to also be the first $j$ characters of $S$. But we already know how to generate the longest proper prefix-suffix of $S_{0\dots i-1}\overline{S_i}$ -- this is just $LIPS[i]$! Thus, we can easily generate our $n$ equations by reading off the values of $LIPS$.

## A Well-Behaved Matrix

All that's left is to show how we can solve our system of $n$ equations in linear time. In general, this is impossible. But in this specific problem there are many nice properties of our system. For example, it is extremely sparse: each equation $e_i = 1 + \frac{1}{2}e_j + \frac{1}{2}e_k$ relates at most three different variables. We also know that (swapping $j$ and $k$ if necessary) we get the conditions $j \leq i$ and $k = i+1$ for each equation. If we rewrite each equation in the form $-e_j + 2e_i - e_{i+1} = 2$ and aggregate them into the standard linear system matrix used in Gaussian elimination, the structure becomes clearer (the following matrix is for $S =$ HTHH):

$\begin{bmatrix} 1 & -1 & 0 & 0 & 0 & 2 \\ 0 & 1 & -1 & 0 & 0 & 2 \\ -1 & 0 & 2 & -1 & 0 & 2 \\ 0 & 0 & -1 & 2 & -1 & 2 \\ 0 & 0 & 0 & 0 & 1 & 0 \end{bmatrix}$

In all rows except the last, the main diagonal is filled with $2$ s, with a $-1$ just to the right. There is also a $-1$ somewhere to the left (or on top of) the $2$ (if it is on top of the $2$, it is just written as a $1$). As with any system of linear equations, our goal is now to reduce this matrix by adding rows to each other. Here's where the well-behaved structure of the matrix becomes useful. Define a row to be almost-reduced if it has a $1$ on the main diagonal, a $-1$ just to the right of it, and $0$ s everywhere else besides the last column. In the matrix above, the top two rows are almost-reduced.

Observe that if the first $i$ rows of the matrix are already almost-reduced, then it is easy to almost-reduce the $i+1$th row. Say that row $i+1$ has a $-1$ in position $j < i+1$, a $2$ in position $i+1$ and another $-1$ in position $i+2$. Then if we add all rows $j, j+1, \dots, i$ to row $i+1$, it will become almost-reduced because the $1$ s and $-1$ s end up telescoping in on each other.

$\begin{bmatrix} 1 & -1 & 0 & 0 & 0 & 2 \\ 0 & 1 & -1 & 0 & 0 & 2 \\ -1 & 0 & 2 & -1 & 0 & 2 \\ 0 & 0 & -1 & 2 & -1 & 2 \\ 0 & 0 & 0 & 0 & 1 & 0 \end{bmatrix} \implies \begin{bmatrix} 1 & -1 & 0 & 0 & 0 & 2 \\ 0 & 1 & -1 & 0 & 0 & 2 \\ 0 & 0 & 1 & -1 & 0 & 6 \\ 0 & 0 & -1 & 2 & -1 & 2 \\ 0 & 0 & 0 & 0 & 1 & 0 \end{bmatrix}$
The first two rows are added to the third row, resulting in it becoming almost-reduced.

In this manner, we can almost-reduce a row in $O(1)$ time by maintaining prefix sums of the values in the last column of the matrix. In fact, the only values we ever need to store besides these prefix sums are the locations of the left-most $-1$ in each row (which correspond to $LIPS[i]$). Once we have almost-reduced all rows, the final answer $e_0$ is the sum of the entire right-most column (the last prefix sum). All of this can be done in linear time.

## Conclusion

The algorithm presented here computes the expected number of coin flips required to achieve a given string in $O(n)$ time. As has been pointed out in the comments, variations of this problem have appeared on contests in the past, and there is a variety of potential approaches -- this is just one way. Thank you for reading!

Here is my final code.

Edit: meiron03 brought this article to my attention, which outlines another very cool way to think about this problem through the lens of a fair casino.

• +185

 » 4 months ago, # |   +41 Congrats, you've invented an autocorrelation polynomial!
•  » » 4 months ago, # ^ |   +8 Wow! I've never seen these before. It's cool that there are two different ways of getting to the same result (although I suspect under they end up doing similar calculations).
 » 4 months ago, # | ← Rev. 2 →   +18 Somewhat related problems:https://www.acmicpc.net/problem/19338https://codeforces.com/gym/102832/problem/G
•  » » 4 months ago, # ^ |   0 Also SRM797 medium which had a few good comments: https://codeforces.com/blog/entry/86586
 » 4 months ago, # |   +26 There is a problem on Timus from 2008 about the same thing, but with the alphabet of size $\sigma$ instead of $2$.In the comments a version of it is given that assumes that each letter $c$ additionally has its own probability $p_c$ to be chosen.Let's say that we're given $s_0 s_1 \dots s_{n-1}$ and probabilities $p_1, \dots, p_\sigma$ for each letter.If you know, what a Knuth-Morris-Pratt automaton is, you can see that you essentially do a random walk on it in such way, that the transition from the vertex $k$ to $\delta(k, c)$ has a probability of $p_c$. Then you can express the expected time of getting from vertex $k$ to vertex $n$ for $k < n$ as $E_k = 1 + p_1 E_{\delta(k, 1)} + \dots + p_\sigma E_{\delta(k,\sigma)}.$Your main goal here is to express $E_0$, as it is the number of turns it would take to go from the starting vertex to the terminal vertex $n$ (= to arrive at string that currently holds $s$ on its suffix).Alternatively, you can write it as $E_k = E_{\rho(k)}+p_{s_{k}}(E_{k+1}-E_{\rho(k+1)}),$where $\rho(k)$ is the largest number $t < k$ such that the prefix and the suffix of length $t$ of $s_0 s_1 \dots s_{k-1}$ coincide.This formula holds because transitions from $k$ are same as from $\rho(k)$ except for transition via $s_{k}$, which leads to $k+1$ from $k$ and to $\rho(k+1)$ from $\rho(k)$. This expression makes sense for $k>0$ and for $k=0$ it would look like $E_0 = 1+ p_{s_1} E_{1} + (1-p_{s_1}) E_0 = 1 + E_0 + p_{s_1} (E_1 - E_0).$Given that $\rho(1)=0$, it is reasonable to define $E_{\rho(0)} = 1 + E_0$ for consistency.Alternatively, the recurrent formula is rewritten as $E_k - E_{\rho(k)} = p_{s_{k}} (E_{k+1} - E_{\rho(k+1)}).$Repeating it several times, we see that $E_k - E_{\rho(k)} = p_{s_k} p_{s_{k+1}} \dots p_{s_{k+i}}(E_{k+i+1} - E_{\rho(k+i+1)}).$We know that $E_0 - E_{\rho(0)}= -1$ and $E_n=0$, which means that $1 = p_{s_0} p_{s_1} \dots p_{s_{n-1}} E_{\rho(n)}.$Repeating it from $E_0 - E_{\rho(0)}$ to $E_{\rho(n)} - E_{\rho(\rho(n))}$, we get $-1 = p_{s_0} p_{s_1} \dots p_{s_{\rho(n)-1}} (E_{\rho(n)} - E_{\rho(\rho(n))}),$which means that $E_{\rho(\rho(n))} = E_{\rho(n)} + \frac{1}{p_{s_0} p_{s_1} \dots p_{s_{\rho(n)-1}}}.$Repeating it further we eventually arrive at $\rho^k(n)=0$ which, denoting $\rho^0(n)=n$, gives us the final answer: $E_0 = \sum\limits_{i=0}^{k-1} \prod\limits_{j=0}^{\rho^i(n)-1} \frac{1}{p_{s_j}}.$In other words, the answer to the problem is the sum of inverse products of $p_{s_0} p_{s_1} \dots p_{s_{k-1}}$ for every $k>0$ such that the suffix and the prefix of $s$ of length $k$ are equal. I wanted to check it on the problem from the gym, but then realized that it asks to compute it over all substrings of $s$.Which is also solvable, but margins of this comment is too narrow to contain any more info...