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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.