Describe the minimum DFA that recognizes the words over $\{a,b\}$ that contain all possible subword of length $2$ with at least one $b$. Note that there are only three of such subwords ($ab$, $ba$, $bb$), but they might be overlapped.