Reorganize String

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Reorganize String** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Max-heap greedy: always pick most frequent not last used **Edge Cases to Consider:** - (1) Impossible reorganization - (2) All same characters - (3) Two distinct characters

Examples

Example 1

Input: "aab"

Output: "aba"

Example 2

Input: "aaab"

Output: ""

Explanation: Impossible

Example 3

Input: "a"

Output: "a"

Explanation: Single char

Constraints

▪Input arguments are within valid ranges
▪Optimize for execution speed
▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

▪Impossible reorganization
▪All same characters
▪Two distinct characters

Frequently Asked At

AmazonGoogleMicrosoftMeta

Back to Arena

medium

Heap