227. Reorganize String (Feasibility)

Given a string s, determine whether its characters can be rearranged so that no two adjacent characters are the same. Return true if possible, otherwise false.

Input: A quoted string s.

Output: Boolean — true or false.

Examples

Input: "aab"
Output: true
Explanation: 'aba' works.

Input: "aaab"
Output: false
Explanation: Too many a's.

Input: "a"
Output: true
Explanation: Single char.

Constraints

• 1<=s.length<=500
• lowercase letters

Asked by