problem767

README

< Previous 　　　　　　　　　　　　　　　　 Next >

767. Reorganize String (Medium)

Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.

If possible, output any possible result.  If not possible, return the empty string.

Example 1:

Input: S = "aab"
Output: "aba"

Example 2:

Input: S = "aaab"
Output: ""

Note:

• S will consist of lowercase letters and have length in range [1, 500].

 

Related Topics

[Heap] [Greedy] [Sort] [String]

Similar Questions

1. Rearrange String k Distance Apart (Hard)
2. Task Scheduler (Medium)

Hints

Hint 1

Alternate placing the most common letters.