Introduction
The number of substrings containing all three characters is a classic combinatorial problem that appears in many coding interviews and algorithmic challenges. Given a string S of length n, the task is to count how many contiguous substrings (segments) include all of the three specified characters—commonly ‘a’, ‘b’, and ‘c’. This count is useful for understanding pattern occurrence, optimizing search algorithms, and solving related dynamic‑programming questions. In this article we will explore the problem from the ground up, present a naïve brute‑force method, then introduce an optimal linear‑time sliding‑window technique, analyze its complexity, and answer frequently asked questions.
Understanding the Problem
Defining the Task
To compute the number of substrings containing all three characters, we must consider every possible substring S[i…j] (where 0 ≤ i ≤ j < n). A substring qualifies if it contains at least one occurrence of each of the three target characters. The characters are usually fixed (e.g., ‘a’, ‘b’, ‘c’), but the same logic applies to any three distinct symbols.
Simple Example
Consider the string S = "abcabc". All substrings that contain ‘a’, ‘b’, and ‘c’ are:
- "abc" (positions 0‑2)
- "abca" (0‑3)
- "