Grokking the Coding Interview: Patterns for Coding Questions
Ask Author
Back to course home

0% completed

Vote For New Content
Rearrange String (hard)
On this page

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

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page