Question
Write a JAVA solution for Given a string S consisting of letters 'a' and 'b',return the minimum number of swaps needed to obtain a string
Write a JAVA solution for
Given a string S consisting of letters 'a' and 'b',return the minimum number of swaps needed to obtain a string with no instances of 3 identical consecutive letters.
You are given a string S consisting of N letters 'a' and / or 'b'. In one move you can swap one letter for the other('a' for 'b' or 'b' for 'a').
write a function solution that,given such a string S,returns the minimum number of moves required to obtain a string containing no instances of 3 identica; consecutive letters.
Examples:
1.Given S = "baaaaa", the function should return 1. The string without 3 identical consecutive letters which can be obtained in one move is "baabaa".
2. Given S = "baaabbaabbba", the function should return 2.There are four valid strings obtainable in 2 ,pves.for example,"bbaabbaabbaa". 3.Given S = "baabab",the function should return 0. Write an efficient algorithm for following assumptions:
. N is an integer within the range[0..200,000]; . String S is made only of the characters "a" and/or "b".
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started