Grokking the Coding Interview: Patterns for Coding Questions

Solution: Rearrange String

## Problem Statement

Given a string, find if its letters can be rearranged in such a way that no two same characters come next to each other.

**Example 1**:
```
Input: "aappp"
Output: "papap"
Explanation: In "papap", none of the repeating characters come next to each other.
```
**Example 2**:
```
Input: "Programming"
Output: "rgmrgmPiano" or "gmringmrPoa" or "gmrPagimnor", etc.
Explanation: None of the repeating characters come next to each other.
```
**Example 3**:
```
Input: "aapa"
Output: ""
Explanation: In all arrangements of "aapa", atleast two 'a' will come together e.g