Problem · String
Maximum Insertions Without Three Consecutive A
Write a function solution that, given a string S consisting of N characters, returns the maximum number of letters 'a' that can be inserted into S (including at the front and end of S) so that the resulting string doesn't contain three consecutive letters 'a'. If string S already contains the substring "aaa", then your function should return -1.
Examples
01 · Example 1
S = "aabab" return = 3
A string "aabaabaa" can be made.
02 · Example 2
S = "dog" return = 8
A string "aadaaoaagaa" can be made.
03 · Example 3
S = "aa" return = 0
No longer string can be made.
04 · Example 4
S = "baaaa" return = -1
There is a substring "aaa".
Constraints
Write an efficient algorithm for the following assumptions:
Nis an integer within the range[1..200,000].- String
Sis made only of lowercase letters('a' - 'z').
More Tesla problems
public int solution(String S) {
// write your code here
}S"aabab"
expected3
checking account