Reform A Substring

Limits: 2s, 512 MB

You are given a string s. You need to reform the string in such a way that there exists at least one substring of length 26 which contains all the lowercase English alphabets. The order of the characters does not matter.


This is a companion discussion topic for the original entry at https://toph.co/p/reform-a-substring