/// Input Required - String to be Balanced. /// Test Cases Passed? - Yes. /// Number of Lines - 40. /* Monday Blue 💙 Challenge Series #14 Let's play with alphabets this week! This time we will need to put alphabets onto the balance scale at 2 ends to achieve equilibrium. If it's impossible to do so, determine the letter need to be added with minimum weight. The letters weight from 1 to 26 which corresponds to A to Z respectively. 💼 TASK Write a program to accept a string of uppercase letters and split into 2 groups which produce the minimum sum difference by using an underscore character "_". If the sum difference is not ZERO, we will need to add a letter (surround it with round brackets) on either side to achieve equilibrium. 🔧 TEST CASE "A" ➡ (A)_A or A_(A) "AA" ➡ A_A "AAA" ➡ A(A)_AA or AA_A(A) "ABC" ➡ AB_C "ABBA" ➡ AB_BA "ABCD" ➡ ABC_D(B) "ZEPHYRKOO" ➡ ZEPHY_RKOO(U) "MONDAYBLUE" ➡ MONDA(R)_YBLUE "CHRISTMAS" ➡ CHRIS_TMAS(D) "IS" ➡ I(J)_S "COMING" ➡ COM_ING(A) "SOON" ➡ SO_ON(E) */ #include #include #include #include #include using namespace std; void Reinterpret(string& s) /// Reinterprets string, /// deleting all non-needed chars { for(char i:s) if(not isupper(i)&¬ isalpha(i)) s.erase(find(s.begin(),s.end(),i)); } int Weight(string s) /// Calculates net weight of string. { int wt = 0; for(char i:s) wt+=static_cast(i-64); return wt; } string Balance(string s) { string s1 = s.substr(0,1), s2 = s.substr(1,s.size()-1); int min = abs(Weight(s1)-Weight(s2)), amin=Weight(s1)-Weight(s2); int pos = 1; for(int i=2;i0) {s2+="("; s2+=char(64+amin); s2+=")";} s = s1+"_"+s2; return s; } int main() { ios::sync_with_stdio(0); string s; cin>>s; Reinterpret(s); cout<

Challenge - Alphabet Balancer