The title prolly ain't clear at all. You are given a string $$$s$$$ and a string $$$t$$$. For every substring $$$s$$$ of length $$$|t|$$$, you are to find the number of different characters between the substring of $$$s$$$ and $$$t$$$ in $$$O(n \cdot log(n))$$$ or less. It is guaranteed that $$$|t| \le |s|$$$.
Example: s: abac t: ag output: [1, 2, 1]
s: adfjaasd t: asdf output: [3, 4, 4, 4, 3]
Don't just downvote, tell me where I should improve or what the answer to my question is. Pls, my contribution is already too low (-75).
Problem statement: 1196D2 - RGB Substring (hard version)