Number of Substrings Containing All Three Characters

Count how many substrings of a string (only 'a', 'b', 'c') contain at least one of each character; the core challenge is to do this efficiently for n up to 5×10^4, typically using a two-pointer/sliding-window counting approach to achieve O(n) time.