Always place the character with the highest remaining frequency next, using a max-heap.

Reorganize String

medium

Acceptance: 42%

HeapGreedyString

Rearrange the characters of a given string so that no two neighboring characters are identical. If such a rearrangement is impossible, return an empty string.

Examples

Example 1:

Input:s = "bbac"

Output:"babc"

Example 2:

Input:s = "aaaa"

Output:""

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Reorganize String

Examples

Hints

Related Problems