## Problem A string is called "cool" if no two adjacent characters are the same. Given a string `s`, determine the minimum number of character replacements needed to make it cool. A replacement changes one character to any other character. ```python def min_replacements_to_cool(s: str) -> int: ... ``` **Example:** ``` Input: "aabbcc" Output: 2 Explanation: Change one 'a' and one 'b': e.g. "acabcc" -> still not cool. Optimal: "ababcc" -> still has "cc". -> "ababcb" -> cool. 2 replacements. Input: "aaaa" Output: 2 Explanation: "abab" requires 2 replacements. ``` **Follow-up variant:** Instead of any character, you may only replace with characters already present in the string. ## Follow-ups - What is the time complexity of your solution? - How does your answer change if you can also swap adjacent characters (not just replace)? - Extend to: find the lexicographically smallest cool string reachable with at most `k` replacements.

InterviewDB Question

Cool String Transformation - Coding Interview

phone

Question Details

Problem A string is called "cool" if no two adjacent characters are the same. Given a string s, determine the minimum number of character replacements needed to make it cool. A replacement changes one character to any other character. Example: Follow…

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Coding Onsite Phone Strings

More from Bloomberg

Reddit What would you grind for Bloomberg? Reddit Bloomberg Tokyo Software Engineer Rejection after Five Rounds Reddit Bloomberg, senior C++ role – what to expect? 1p3a Bloomberg Fulltime SDE Interview Experience and Coding Challenges 1p3a Bloomberg SSE Bquant SF Interview Experience and Reject

← All Bloomberg questions Bloomberg Software Engineer Questions → All Strings Questions →