# Python: Check if the letters of a given string can be rearranged so that two characters that are adjacent to each other are different

## Python heap queue algorithm: Exercise-15 with Solution

Write a Python program to check if the letters in a given string can be rearranged. This is to make sure that two characters that are adjacent to each other are different using the heap queue algorithm.

Note:

If there is no output return the empty string.

**Sample Solution**:

**Python Code:**

```
import heapq
from collections import Counter
def reorganizeString(S):
ctr = Counter(S)
heap = [(-value, key) for key, value in ctr.items()]
heapq.heapify(heap)
if (-heap[0][0]) * 2 > len(S) + 1:
return ""
ans = []
while len(heap) >= 2:
nct1, char1 = heapq.heappop(heap)
nct2, char2 = heapq.heappop(heap)
ans.extend([char1, char2])
if nct1 + 1: heapq.heappush(heap, (nct1 + 1, char1))
if nct2 + 1: heapq.heappush(heap, (nct2 + 1, char2))
return "".join(ans) + (heap[0][1] if heap else "")
print(reorganizeString("aab"))
print(reorganizeString("abc"))
print(reorganizeString("aabb"))
print(reorganizeString("abccdd"))
```

Sample Output:

aba abc abab cdabcd

**Flowchart:**

**Python Code Editor:**

**Have another way to solve this solution? Contribute your code (and comments) through Disqus.**

**Previous:** Write a Python program to get the k most frequent elements from a given non-empty list of words using Heap queue algorithm.

** Next:** Write a Python program which add integer numbers from the data stream to a heapq and compute the median of all elements.

**What is the difficulty level of this exercise?**

Test your Programming skills with w3resource's quiz.

**It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.**

https://www.w3resource.com/python-exercises/heap-queue-algorithm/python-heapq-exercise-15.php

**Weekly Trends and Language Statistics**- Weekly Trends and Language Statistics