Blog

You are given a string ‘s‘ of lowercase English letters. You…

You are given a string ‘s‘ of lowercase English letters. Your task is to remove all adjacent duplicatecharacters from the string using a stack. Two characters are considered adjacent duplicates if they arethe same and next to each other. Example: Input: s = “abbaca”Output: “ca”Explanation:• In “abbaca” we have “bb” as adjacent duplicates, removing them results in “aaca”.• In “aaca” we have “aa” as adjacent duplicates, removing them results in “ca”.     #include #include #include std::string removeDuplicates(const std::string& s) {std::stack charStack;for (char c : s) {//to do- implement the logic involving charStack}std::string result;while (!charStack.empty()) {//to do — construct the result string from the stack}return result;}