Given a string with char and number of replacement can be make, return the number of the longest substring with the same char eg: abcd 1 -> aacd, bbcd, abbd.... 2 aabacdbaeed 1 -> aaaacdbaeed 4 aabdacdace 2 ->aaaaacdace 5