Hello Codeforces, I have received a notification that my submission for problem 2149E (https://codeforces.me/contest/2149/submission/340465979) has been flagged.

The question is basically the most commonly found pattern questions based on the sliding window, which can be found on leetcode. So since I am used to this pattern, implementation in the way that I had done, was the most intuitive, and I was used to it. The following are the leetcode questions: https://leetcode.com/problems/subarrays-with-k-different-integers/description/ https://leetcode.com/problems/binary-subarrays-with-sum/description/ https://leetcode.com/problems/count-number-of-nice-subarrays/description/ https://leetcode.com/problems/number-of-subarrays-with-and-value-of-k/description/ and many more Basically, the technique of using sliding window, but for finding at most k, and then at most k-1 and then subtracting to get exactly k. This algorithm is pretty common, so similarity is based upon mere coincidences, and re-evaluation should be done to give a fair judgment.

I ensure that I have never copied or used any unfair means to write any code. The similarity is all because of its too basic, standard algorithmic nature.

I kindly request you to re-evaluate and give a suitable judgment regarding the same

Thanking you, Solandra