Language where every prefix has almost equal a's and b's
Hint: as you read each letter of the input, imagine trying to keep track of the difference between the number of $a$'s and the number of $b$'s.  What is the set of possible values that this could possibly take on, if the input is in $L$?  What's the largest this difference could be?  What's the smallest it could be?