Here is the [link](https://mirror.codeforces.com/contest/1110/problem/D) to the problem . I have gone through the editorial but didn't got the approach ( _Although I got that we don't need to take more than 2 occurences of a partical triplet [x1,x1+1.,x1+2]_ ) ,I was thinking of DP with three states position i, frequency of i-1<sup>th</sup> character we took and frequency of i-2<sup>nd</sup> character we took. ↵
↵
But wasn't able to come up with a solution. Can anybody help me with the solution ?
↵
But wasn't able to come up with a solution. Can anybody help me with the solution ?