13. Write an algorithm to remove adjacent duplicate characters from a given string. Note that after...

Transcribed Image Text:

13. Write an algorithm to remove adjacent duplicate characters from a given string. Note that after removing a pair of adjacent duplicate characters, two duplicate characters that were previous non- adjacent may become adjacent. For example, "careermonk" "camonk" and "mississippi" "m". Your algorithm should run in O(n) time, where n is the length of the input string. 13. Write an algorithm to remove adjacent duplicate characters from a given string. Note that after removing a pair of adjacent duplicate characters, two duplicate characters that were previous non- adjacent may become adjacent. For example, "careermonk" "camonk" and "mississippi" "m". Your algorithm should run in O(n) time, where n is the length of the input string.