problem767

README

< Previous 　　　　　　　　　　　　　　　　 Next >

767. Reorganize String (Medium)

Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.

Return any possible rearrangement of s or return "" if not possible.

 

Example 1:

Input: s = "aab"
Output: "aba"

Example 2:

Input: s = "aaab"
Output: ""

 

Constraints:

• 1 <= s.length <= 500
• s consists of lowercase English letters.

Related Topics

[Hash Table] [String] [Greedy] [Sorting] [Heap (Priority Queue)] [Counting]

Similar Questions

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

Hints

Hint 1

Alternate placing the most common letters.