Rearrange characters | Practice

Problem
Contest

Here is some troubleshooting advice:

Reset the IDE using the second button on the top right corner.
Avoid using static/global variables in your code as your code is tested against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.
You can access the hints to get an idea about what is expected of you as well as the final solution code.
You can view the solutions submitted by other users from the submission tab.

Still facing issue? Click here.

Here is some troubleshooting advice for contest problems

Make sure you are not using ad-blockers.
Disable browser extensions.
We recommend using latest version of your browser for best experience.
Avoid using static/global variables in coding problems as your code is tested against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases in coding problems does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.

Still facing issue? Click here.

Suggest Changes in Problem Statement:

Given a string S with repeated characters. The task is to rearrange characters in a string such that no two adjacent characters are the same. 
Note: The string has only lowercase English alphabets and it can have multiple solutions. Return any one of them.

Example 1:

<pre>
Input : str = "geeksforgeeks"
Output: 1
Explanation: All the repeated characters of the
given string can be rearranged so that no 
adjacent characters in the string is equal.
Any correct rearrangement will show a output
of 1.</pre>

Example 2:

<pre>
Input : str = "bbbbb"
Output: 0
Explanation: Repeated characters in the string
cannot be rearranged such that there should not
be any adjacent repeated character.</pre>

<div>You don't have to read input or print anything. Your task is to complete the functionrearrangeString() which takes the string as input and returns the modified string. If the string cannot be modified return "-1". 
Note:The generatedoutput is 1 if the string is successfully rearranged and is 0 if rearranging is not possible.</div>

<div>Expected Time Complexity : O(NlogN), N = length of String</div>

<div>Expected Auxiliary Space : O(number of english alphabets)</div>

<div>Constraints :</div>

Given a string S with repeated characters. The task is to rearrange characters in a string such that no two adjacent characters are the same. 
Note: The string has only lowercase English alphabets and it can have multiple solutions. Return any one of them.

Example 1:

<pre>
Input : str = "geeksforgeeks"
Output: 1
Explanation: All the repeated characters of the
given string can be rearranged so that no 
adjacent characters in the string is equal.
Any correct rearrangement will show a output
of 1.</pre>

Example 2:

<pre>
Input : str = "bbbbb"
Output: 0
Explanation: Repeated characters in the string
cannot be rearranged such that there should not
be any adjacent repeated character.</pre>

<div>You don't have to read input or print anything. Your task is to complete the functionrearrangeString() which takes the string as input and returns the modified string. If the string cannot be modified return "-1". 
Note:The generatedoutput is 1 if the string is successfully rearranged and is 0 if rearranging is not possible.</div>

<div>Expected Time Complexity : O(NlogN), N = length of String</div>

<div>Expected Auxiliary Space : O(number of english alphabets)</div>

<div>Constraints :</div>

Loading...

Editorial

Loading...

All Submissions

My Submissions:

Output Window

Message

Loading...

Editorial

Loading...

All Submissions

My Submissions:

Output Window

Select Operation Mode