How many substrings of length m can be formed from a string of length n?

Simple counting problem but can't wrap my head around it

ABCD -- Substrings of length 2 : AB, BC, CD. Similarly ABCDE and length 3 -- ABC, BCD, CDE

I see m choose n won't work -- we'll get all subsequences too

Solution 1:

Consider how many of the characters in the string are valid "starting characters" for the substrings you desire. For instance, in "ABCD," only "A", "B", and "C" are valid starting characters for substrings of length 2.

In general, in a string of length $n$, if you want a substring of length $m$, you can only choose the first $n - m + 1$ characters as starting characters.

Convergence in Distribution of the maximum of a sequence.

Converting a function for "velocity vs. position", $v(x)$, to "position vs. time", $p(t)$

How many different sudoku puzzles are there?

Verification of Proof that a nonabelian group G of order pq where p and q are primes has a trivial center

A differentiable manifold of class $\mathcal{C}^{r}$ tangent to $E^{\pm}$ and representable as graph

Proving the combinatorial identity ${n \choose k} = {n-2\choose k-2} + 2{n-2\choose k-1} + {n-2\choose k}$

Probability of complete coupon set in $K$ boxes where a box has $N$ distinct coupons?

Prime ideal in a polynomial ring over an integrally closed domain [closed]

Show that all horses are of the same color.

Riemann Zeta Function Manipulation

Prove: If $\sum \limits_{n=1}^{\infty}|f_n|$ converges uniformly, so does $\sum \limits_{n=1}^{\infty}f_n$.

positive linear functionals are bounded in $C^*$-algebras