Reorganize String
Explore how to rearrange strings to ensure no two identical characters appear next to each other. This lesson helps you understand problem constraints and implement solutions that validate if such reorganization is possible within given limits.
We'll cover the following...
Statement
Given a string, str, rearrange it so that any two adjacent characters are not the same. If such a reorganization of the characters is possible, output any possible valid arrangement. Otherwise, return an empty string.
Constraints:
-
str.length - Input string consists of lowercase English letters.
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check that if you’re solving the correct problem:
Reorganize String
(Select all that apply.) What is the output if str = "programming"? Multi-select
“programing”
“rgmrgmpiano”
“rmpimrggano”
“programimng”
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground:
package mainfunc reorganizeString(str string) string {// Replace this placeholder return statement with your codereturn ""}