Balanced Strings

Problem Statement

Balanced Strings Problem Description A string, s , is composed of the letters a , b , c , and d . The string is said to be balanced if both of the following conditions are satisfied: The summed number of a 's and c 's is even. The summed number of b 's and d 's is even. For example, the string 'abcd' ( a count + c count = 1 + 1 = 2, even; b count + d count = 1 + 1 = 2, even) is balanced, but 'abc' and 'bcd' are not. Complete the code in the editor below by filling in the blank (i.e., ______) with a RegEx that only matches balanced strings. Examples Example 1: Input: s = "acdbdbbbbaaacaac" Output: true Explanation: There are six a's and c's in the string and eight b's and d's. Thus, the string is balanced. Example 2: Input: s = "cdba" Output: true Explanation: There are two a's and c's in the string and two b's and d's. Thus, the string is balanced. Example 3: Input: s = "aaccb" Output: false Explanation: There are four a's and c's in the string and only one b (there are no d's). Thus,