Implementing String Algorithms Practice Test

Problem: Implement public static String compress(String inputString) using run-length encoding: replace consecutive repeated characters with the character followed by the count (always include the count). Input: one string. Output: compressed string. Example: "aaabbc" -> "a3b2c1". Constraints: $0 \le$ length $\le 10^5$. Given the problem description above, what is the output of the function when given the input "aabccc"?

Problem: Write public static int countChar(String inputString, char target) that counts occurrences of target in inputString using a loop. Input: a string and a character. Output: count as an int. Example: ("mississippi", 's') -> 4. Constraints: $0 \le$ length $\le 10^5$. Given the problem description above, which function signature matches the problem requirements?