Balanced Strings

Problem Statement

Balanced Strings Problem Description You are given a string s made up only of the letters 'a' , 'b' , 'c' and 'd' . The string is called balanced when both of the following hold: the summed number of 'a' s and 'c' s in s is even, and the summed number of 'b' s and 'd' s in s is even. For example, "abcd" is balanced: its 'a' count plus its 'c' count is 1 + 1 = 2 , which is even, and its 'b' count plus its 'd' count is 1 + 1 = 2 , which is also even. By contrast "abc" is not balanced ( 'a' + 'c' = 2, even, but 'b' + 'd' = 1, odd), and neither is "bcd" ( 'a' + 'c' = 1, odd). Report whether the given string is balanced. Input Format A single line containing the string s . (inferred - the source captures show the value arriving on STDIN as the sole function parameter s , but do not print an "Input Format" block; the string occupies the whole line and contains no spaces.) Output Format Print exactly one line: true if s is balanced, and false otherwise. Both words are lowercase. (inferred - t