LeetCode 1576: Replace All ?'s to Avoid Consecutive Repeating Characters Solution

Master LeetCode problem 1576 (Replace All ?'s to Avoid Consecutive Repeating Characters), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1576. Replace All ?'s to Avoid Consecutive Repeating Characters

Easy

String

Problem Explanation

Explanation:

To solve this problem, we need to iterate through the string and replace any '?' character with a lowercase letter such that there are no consecutive repeating characters. We can achieve this by checking the characters before and after the '?' to determine the valid replacements. If the character before '?' is 'a' and the character after '?' is 'b', then we can replace '?' with any letter except 'a' and 'b'. :

Solution Code

class Solution {
    public String modifyString(String s) {
        char[] charArray = s.toCharArray();
        
        for (int i = 0; i < charArray.length; i++) {
            if (charArray[i] == '?') {
                char prev = (i == 0) ? ' ' : charArray[i - 1];
                char next = (i == charArray.length - 1) ? ' ' : charArray[i + 1];
                
                char replacement = 'a';
                while (replacement == prev || replacement == next) {
                    replacement++;
                }
                charArray[i] = replacement;
            }
        }
        
        return new String(charArray);
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1576 (Replace All ?'s to Avoid Consecutive Repeating Characters)?

This page provides optimized solutions for LeetCode problem 1576 (Replace All ?'s to Avoid Consecutive Repeating Characters) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1576 (Replace All ?'s to Avoid Consecutive Repeating Characters)?

The time complexity for LeetCode 1576 (Replace All ?'s to Avoid Consecutive Repeating Characters) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1576 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1576 in Java, C++, or Python.

Back to LeetCode Solutions