Leetcode 1876. Substrings of Size Three with Distinct Characters

Count how many contiguous substrings of length three in s contain three distinct characters. This is a straightforward fixed-size sliding-window / uniqueness-check problem (s length ≤ 100, lowercase letters).