Company: ibm_10sep
Difficulty: medium
Minimum Special Subsequences Problem Description A binary string needs to be transmitted between two servers. According to a network control protocol, data can only be sent in the form of 'special strings', i.e., binary strings where no two adjacent characters are the same. Any data to be transmitted must first be broken into one or more subsequences that are special strings, with each special string sent as a separate data packet. Find the minimum number of data packets required to send a given binary string. Note: A subsequence is obtained by deleting some characters from the original string while maintaining the order of the remaining characters. Complete the function getMinSubsequences in the editor with the following parameter: string input_str: a binary string Returns: int: the minimum number of subsequences that the string can be broken into Examples Example 1: Input: input_str = "00100" Output: 3 Explanation: This string can be broken into three special subsequences: "0" (first