We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Super Reduced String
  5. Discussions

Super Reduced String

  • ajcuddeback
     + 1 comment

    Solution using Javascript using recursion and regex:

    const regex = /([a-z])\1/g;

function superReducedString(s) {
    let replaced = removeAdjacents(s);
    
    while(checkForAdjacents(replaced)) {
        replaced = removeAdjacents(replaced)
    }
    
    if(replaced === "") {
        return "Empty String"
    }
    
    return replaced
}

const removeAdjacents = (str) => {
    return str.replaceAll(regex, '');
}

const checkForAdjacents = (str) => {
    
    return regex.test(str);
}