Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if there exists a permutation of given string which doesn’t contain any monotonous substring

  • Difficulty Level : Medium
  • Last Updated : 21 May, 2021

Given a string S of lowercase English alphabets, the task is to check if there exists an arrangement of string S such that it doesn’t contain any monotonous substring. 

A monotonous substring has the following properties: 

Attention reader! All those who say programming isn't for kids, just haven't met the right mentors yet. Join the  Demo Class for First Step to Coding Course, specifically designed for students of class 8 to 12. 

The students will get to learn more about the world of programming in these free classes which will definitely help them in making a wise career choice in the future.

  • Length os such substring is 2.
  • Both the characters are consecutive, For example – “ab”, “cd”, “dc”, “zy” etc.

Examples:  



Input: S = “abcd” 
Output: Yes 
Explanation: 
String S can be rearranged into “cadb” or “bdac”

Input: string = “aab” 
Output: No 
Explanation: 
Every arrangement of the string contains a monotonous substring. 

Approach: The idea is group the characters into two different buckets, where one bucket contains the characters which are at the even places and another bucket contains the characters which are at the odd places. Finally, check for the concatenation point of both the group is not a monotonous substring.

Below is the implementation of the above approach: 

C++




// C++ implementation such that there
// are no monotonous
// string in given string
 
#include <bits/stdc++.h>
 
using namespace std;
 
// Function to check a string doesn't
// contains a monotonous substring
bool check(string s)
{
    bool ok = true;
 
    // Loop to iterate over the string
    // and check that it doesn't contains
    // the monotonous substring
    for (int i = 0; i + 1 < s.size(); ++i)
        ok &= (abs(s[i] - s[i + 1]) != 1);
    return ok;
}
 
// Function to check that there exist
// a arrangement of string such that
// it doesn't contains monotonous substring
string monotonousString(string s)
{
    string odd = "", even = "";
 
    // Loop to group the characters
    // of the string into two buckets
    for (int i = 0; i < s.size(); ++i) {
        if (s[i] % 2 == 0)
            odd += s[i];
        else
            even += s[i];
    }
 
    // Sorting the two buckets
    sort(odd.begin(), odd.end());
    sort(even.begin(), even.end());
 
    // Condition to check if the
    // concatenation point doesn't
    // contains the monotonous string
    if (check(odd + even))
        return "Yes";
    else if (check(even + odd))
        return "Yes";
    return "No";
}
 
// Driver Code
int main()
{
    string str = "abcd";
    string ans;
    ans = monotonousString(str);
    cout << ans << endl;
    return 0;
}
Java



// Java implementation such that there
// are no monotonous
// string in given string
import java.io.*;
import java.util.*;
 
class GFG{
     
// Function to check a string doesn't
// contains a monotonous substring
static boolean check(String s)
{
    boolean ok = true;
 
    // Loop to iterate over the string
    // and check that it doesn't contains
    // the monotonous substring
    for (int i = 0; i + 1 < s.length(); ++i)
        ok &= (Math.abs(s.charAt(i) -
                        s.charAt(i + 1)) != 1);
    return ok;
}
 
// Function to check that there exist
// a arrangement of string such that
// it doesn't contains monotonous substring
static String monotonousString(String s)
{
    String odd = "", even = "";
 
    // Loop to group the characters
    // of the string into two buckets
    for (int i = 0; i < s.length(); ++i)
    {
        if (s.charAt(i) % 2 == 0)
            odd += s.charAt(i);
        else
            even += s.charAt(i);
    }
 
    // Sorting the two buckets
    char oddArray[] = odd.toCharArray();
    Arrays.sort(oddArray);
    odd = new String(oddArray);
     
    char evenArray[] = even.toCharArray();
    Arrays.sort(evenArray);
    even = new String(evenArray);
     
    // Condition to check if the
    // concatenation point doesn't
    // contains the monotonous string
    if (check(odd + even))
        return "Yes";
    else if (check(even + odd))
        return "Yes";
    return "No";
}
 
// Driver Code
public static void main(String []args)
{
    String str = "abcd";
    String ans;
    ans = monotonousString(str);
    System.out.println( ans);
}
}
 
// This code is contributed by ChitraNayal
Python3



# Python3 implementation such that there
# are no monotonous string in given string
 
# Function to check a string doesn't
# contains a monotonous substring
def check(s):
     
    ok = True
 
    # Loop to iterate over the string
    # and check that it doesn't contains
    # the monotonous substring
    for i in range(0, len(s) - 1, 1):
        ok = (ok & (abs(ord(s[i]) -
                        ord(s[i + 1])) != 1))
    return ok
 
# Function to check that there exist
# a arrangement of string such that
# it doesn't contains monotonous substring
def monotonousString(s):
     
    odd = ""
    even = ""
 
    # Loop to group the characters
    # of the string into two buckets
    for i in range(len(s)):
         
        if (ord(s[i]) % 2 == 0):
            odd += s[i]
        else:
            even += s[i]
 
    # Sorting the two buckets
    odd = list(odd)
    odd.sort(reverse = False)
    odd = str(odd)
     
    even = list(even)
    even.sort(reverse = False)
    even = str(even)
 
    # Condition to check if the
    # concatenation point doesn't
    # contains the monotonous string
    if (check(odd + even)):
        return "Yes"
    elif (check(even + odd)):
        return "Yes"
         
    return "No"
 
# Driver Code
if __name__ == '__main__':
     
    str1 = "abcd"
    ans = monotonousString(str1)
     
    print(ans)
 
# This code is contributed by Samarth
C#



// C# implementation such that there
// are no monotonous
// string in given string
using System;
 
class GFG{
     
// Function to check a string doesn't
// contains a monotonous substring
static bool check(string s)
{
    bool ok = true;
 
    // Loop to iterate over the string
    // and check that it doesn't contains
    // the monotonous substring
    for(int i = 0; i + 1 < s.Length; ++i)
        ok &= (Math.Abs(s[i] -
                        s[i + 1]) != 1);
                         
    return ok;
}
 
// Function to check that there exist
// a arrangement of string such that
// it doesn't contains monotonous substring
static string monotonousString(string s)
{
    string odd = "", even = "";
 
    // Loop to group the characters
    // of the string into two buckets
    for(int i = 0; i < s.Length; ++i)
    {
        if (s[i] % 2 == 0)
            odd += s[i];
        else
            even += s[i];
    }
 
    // Sorting the two buckets
    char []oddArray = odd.ToCharArray();
    Array.Sort(oddArray);
    odd = new String(oddArray);
     
    char []evenArray = even.ToCharArray();
    Array.Sort(evenArray);
    even = new String(evenArray);
     
    // Condition to check if the
    // concatenation point doesn't
    // contains the monotonous string
    if (check(odd + even))
        return "Yes";
         
    else if (check(even + odd))
        return "Yes";
         
    return "No";
}
 
// Driver Code
public static void Main(string []args)
{
    string str = "abcd";
    string ans;
     
    ans = monotonousString(str);
     
    Console.Write(ans);
}
}
 
// This code is contributed by rutvik_56
Javascript



<script>
 
// Javascript implementation such that there
// are no monotonous
// string in given string
 
// Function to check a string doesn't
// contains a monotonous substring
function check(s)
{
    var ok = true;
 
    // Loop to iterate over the string
    // and check that it doesn't contains
    // the monotonous substring
    for (var i = 0; i + 1 < s.length; ++i)
        ok &= (Math.abs(s[i] - s[i + 1]) != 1);
    return ok;
}
 
// Function to check that there exist
// a arrangement of string such that
// it doesn't contains monotonous substring
function monotonousString(s)
{
    var odd = "", even = "";
 
    // Loop to group the characters
    // of the string into two buckets
    for (var i = 0; i < s.length; ++i) {
        if (s[i] % 2 == 0)
            odd += s[i];
        else
            even += s[i];
    }
 
    // Sorting the two buckets
    odd  = odd.split('').sort().join('');
    even = even.split('').sort().join('');
 
    // Condition to check if the
    // concatenation point doesn't
    // contains the monotonous string
    if (check(odd + even))
        return "Yes";
    else if (check(even + odd))
        return "Yes";
    return "No";
}
 
// Driver Code
var str = "abcd";
var ans;
ans = monotonousString(str);
document.write( ans );
 
 
</script>
Output: 
Yes
 



My Personal Notes
arrow_drop_up
Previous
Minimize prize count required such that smaller value gets less prize in an adjacent pair
Next

Check if the number is a Prime power number
Recommended Articles
Page :
Check if there exists any sub-sequence in a string which is not palindrome
29, Oct 18
Minimize splits to generate monotonous Substrings from given String
21, Aug 20
Lexicographically smallest string of maximum length made up of first K alphabets that does not contain any repeating substring
13, May 21
Smallest non-zero substring which has any permutation divisible by 2^K
27, Dec 19
Check if any permutation of a given string is lexicographically larger than the other given string
15, Sep 21
Length of the longest substring that do not contain any palindrome
08, May 19
Length of the longest substring that does not contain any vowel
18, Jun 21
Queries to check if string B exists as substring in string A
27, May 19
Check if any permutation of N equals any power of K
08, Nov 18
Check if any permutation of a number without any leading zeros is a power of 2 or not
10, Sep 20
Check if a String contains Anagrams of length K which does not contain the character X
31, Jul 20
Check if permutation of one string can break permutation of another
28, Jul 20
Check if any permutation of string is a K times repeated string
08, Apr 20
Count of strings that does not contain any character of a given string
26, Nov 21
Check if there is any common character in two given strings
22, Oct 18
Lexicographic smallest permutation of a String containing the second String as a Substring
20, Aug 20
Check if concatenation of any permutation of given list of arrays generates the given array
28, Sep 20
Check if a string can be split into two substrings such that one substring is a substring of the other
23, Dec 20
Count the nodes of a tree whose weighted string does not contain any duplicate characters
28, May 19
Length of the largest substring which have character with frequency greater than or equal to half of the substring
29, May 19
Check if permutation of first N natural numbers exists having Bitwise AND of adjacent elements non-zero
28, Oct 20
DFA that begins with 'a' but does not contain substring 'aab'
26, Jun 20
Lexicographically shortest string of length at most K which is not a substring of given String
05, Aug 21
Length of smallest substring of a given string which contains another string as subsequence
06, Oct 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
coder001
@coder001
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!