Given a string str with repeated characters, the task is to rearrange the characters in a string such that no two adjacent characters are same. If it is possible then print Yes else print No.
Input: str = “geeksforgeeks”
“egeksforegeks” is one such arrangement.
Input: str = “bbbbb”
Approach: The idea is to store the frequency of each character in an unordered_map and compare maximum frequency of character with the difference of string length and maximum frequency number. If the maximum frequency is less than the difference then it can be arranged otherwise not.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Rearrange characters in a string such that no two adjacent are same
- Rearrange the characters of the string such that no two adjacent characters are consecutive English alphabets
- Rearrange string such that no pair of adjacent characters are of the same type
- Rearrange numbers in an array such that no two adjacent numbers are same
- Replace '?' in a string such that no two adjacent characters are same
- String with k distinct characters and no same characters adjacent
- Rearrange a string so that all same characters become atleast d distance away
- Rearrange a string so that all same characters become d distance away
- Minimum string such that every adjacent character of given string is still adjacent
- Rearrange the given string such that all prime multiple indexes have same character
- Length of longest Palindromic Subsequence of even length with no two adjacent characters same
- Rearrange array such that difference of adjacent elements is in descending order
- Minimum characters that are to be inserted such that no three consecutive characters are same
- Permutation of a string with maximum number of characters greater than its adjacent characters
- Check whether two strings contain same characters in same order
- Min flips of continuous characters to make all characters same in a string
- String hashing using Polynomial rolling hash function
- Number of ways to remove a sub-string from S such that all remaining characters are same
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- Minimum Cost of deletions such that string does not contains same consecutive characters
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.