 GeeksforGeeks App
Open App Browser
Continue

# Lexicographically smallest permutation of a string that contains all substrings of another string

Given two strings A and B, the task is to find lexicographically the smallest permutation of string B such that it contains every substring from the string A as its substring. Print “-1” if no such valid arrangement is possible.
Examples:

Input: A = “aa”, B = “ababab”
Output: aaabbb
Explanation:
All possible substrings of A are (‘a’, ‘a’, ‘aa’)
Rearrange string B to “aaabb”.
Now “aaabb” is the lexicographically the smallest arrangement of B which contains all the substrings of A.

Input: A = “aaa”, B = “ramialsadaka”
Explanation:
All possible substrings of A are (‘a’, ‘aa’, ‘aaa’)
Now “aaaaadiklmrs” is the lexicographically smallest arrangement of B which contains all the substrings of A.

Naive Approach: The simplest approach is to generate all possible permutations of the string B and then from all these permutations, find lexicographically the smallest permutation which contains all substrings of A.

Time Complexity: O(N!)
Auxiliary Space: O(1)

Efficient Approach: To optimize the above approach, the main observation is that the smallest string that contains all the substrings of A is the string A itself. Therefore, for string B to be reordered and contain all substring of A, it must contain A as a substring. The reordered string B can contain A as its substring only if the frequency of each character in string B is greater than or equal to its frequency in A. Below are the steps:

1. Count the frequency of each character in string B in an array freq[] and then subtract from it the frequencies of the corresponding characters in string A.
2. In order to form lexicographically the smallest string, initialize an empty string result and then append to it, all the leftover characters which are less in value than the first character of string A.
3. Before appending all the characters equal to the first character A to result, check if there is any character which is less than the first character in string A. If so, then append A to result first and then all the remaining characters equal to the first character of A to make the reordered string lexicographically smallest.
4. Otherwise, append all remaining occurrences of A and then append A.
5. At last, append the remaining characters to the result.
6. After the above steps, print the string result.

Below is the implementation of the above approach:

## C++

 `// C++ program for the above approach` `#include ``using` `namespace` `std;` `// Function to reorder the string B``// to contain all the substrings of A``string reorderString(string A, string B)``{``    ``// Find length of strings``    ``int` `size_a = A.length();``    ``int` `size_b = B.length();` `    ``// Initialize array to count the``    ``// frequencies of the character``    ``int` `freq = { 0 };` `    ``// Counting frequencies of``    ``// character in B``    ``for` `(``int` `i = 0; i < size_b; i++)``        ``freq[B[i]]++;` `    ``// Find remaining character in B``    ``for` `(``int` `i = 0; i < size_a; i++)``        ``freq[A[i]]--;` `    ``for` `(``int` `j = ``'a'``; j <= ``'z'``; j++) {``        ``if` `(freq[j] < 0)``            ``return` `"-1"``;``    ``}` `    ``// Declare the reordered string``    ``string answer;` `    ``for` `(``int` `j = ``'a'``; j < A; j++)` `        ``// Loop until freq[j] > 0``        ``while` `(freq[j] > 0) {``            ``answer.push_back(j);` `            ``// Decrement the value``            ``// from freq array``            ``freq[j]--;``        ``}` `    ``int` `first = A;` `    ``for` `(``int` `j = 0; j < size_a; j++) {` `        ``// Check if A[j] > A``        ``if` `(A[j] > A)``            ``break``;` `        ``// Check if A[j] < A``        ``if` `(A[j] < A) {``            ``answer += A;``            ``A.clear();``            ``break``;``        ``}``    ``}` `    ``// Append the remaining characters``    ``// to the end of the result``    ``while` `(freq[first] > 0) {``        ``answer.push_back(first);``        ``--freq[first];``    ``}` `    ``answer += A;` `    ``for` `(``int` `j = ``'a'``; j <= ``'z'``; j++)` `        ``// Push all the values from``        ``// frequency array in the answer``        ``while` `(freq[j]--)``            ``answer.push_back(j);` `    ``// Return the answer``    ``return` `answer;``}` `// Driver Code``int` `main()``{``    ``// Given strings A and B``    ``string A = ``"aa"``;``    ``string B = ``"ababab"``;` `    ``// Function Call``    ``cout << reorderString(A, B);` `    ``return` `0;``}`

## Java

 `// Java program for``// the above approach``class` `GFG{` `// Function to reorder the String B``// to contain all the subStrings of A``static` `String reorderString(``char` `[]A,``                            ``char` `[]B)``{``  ``// Find length of Strings``  ``int` `size_a = A.length;``  ``int` `size_b = B.length;` `  ``// Initialize array to count the``  ``// frequencies of the character``  ``int` `freq[] = ``new` `int``[``300``];` `  ``// Counting frequencies of``  ``// character in B``  ``for` `(``int` `i = ``0``; i < size_b; i++)``    ``freq[B[i]]++;` `  ``// Find remaining character in B``  ``for` `(``int` `i = ``0``; i < size_a; i++)``    ``freq[A[i]]--;` `  ``for` `(``int` `j = ``'a'``; j <= ``'z'``; j++)``  ``{``    ``if` `(freq[j] < ``0``)``      ``return` `"-1"``;``  ``}` `  ``// Declare the reordered String``  ``String answer = ``""``;` `  ``for` `(``int` `j = ``'a'``; j < A[``0``]; j++)` `    ``// Loop until freq[j] > 0``    ``while` `(freq[j] > ``0``)``    ``{``      ``answer+=j;` `      ``// Decrement the value``      ``// from freq array``      ``freq[j]--;``    ``}` `  ``int` `first = A[``0``];` `  ``for` `(``int` `j = ``0``; j < size_a; j++)``  ``{``    ``// Check if A[j] > A``    ``if` `(A[j] > A[``0``])``      ``break``;` `    ``// Check if A[j] < A``    ``if` `(A[j] < A[``0``])``    ``{``      ``answer += String.valueOf(A);``      ``A = ``new` `char``[A.length];``      ``break``;``    ``}``  ``}` `  ``// Append the remaining characters``  ``// to the end of the result``  ``while` `(freq[first] > ``0``)``  ``{``    ``answer += String.valueOf((``char``)first);``    ``--freq[first];``  ``}` `  ``answer += String.valueOf(A);` `  ``for` `(``int` `j = ``'a'``; j <= ``'z'``; j++)` `    ``// Push all the values from``    ``// frequency array in the answer``    ``while` `(freq[j]-- > ``0``)``      ``answer += ((``char``)j);` `  ``// Return the answer``  ``return` `answer;``}` `// Driver Code``public` `static` `void` `main(String[] args)``{``  ``// Given Strings A and B``  ``String A = ``"aa"``;``  ``String B = ``"ababab"``;` `  ``// Function Call``  ``System.out.print(reorderString(A.toCharArray(),``                                 ``B.toCharArray()));``}``}` `// This code is contributed by 29AjayKumar`

## Python3

 `# Python3 program for the above approach` `# Function to reorder the B``# to contain all the substrings of A``def` `reorderString(A, B):``    ` `    ``# Find length of strings``    ``size_a ``=` `len``(A)``    ``size_b ``=` `len``(B)` `    ``# Initialize array to count the``    ``# frequencies of the character``    ``freq ``=` `[``0``] ``*` `300` `    ``# Counting frequencies of``    ``# character in B``    ``for` `i ``in` `range``(size_b):``        ``freq[``ord``(B[i])] ``+``=` `1` `    ``# Find remaining character in B``    ``for` `i ``in` `range``(size_a):``        ``freq[``ord``(A[i])] ``-``=` `1` `    ``for` `j ``in` `range``(``ord``(``'a'``), ``ord``(``'z'``) ``+` `1``):``        ``if` `(freq[j] < ``0``):``            ``return` `"-1"` `    ``# Declare the reordered string``    ``answer ``=` `[]` `    ``for` `j ``in` `range``(``ord``(``'a'``), ``ord``(A[``0``])):` `        ``# Loop until freq[j] > 0``        ``while` `(freq[j] > ``0``):``            ``answer.append(j)` `            ``# Decrement the value``            ``# from freq array``            ``freq[j] ``-``=` `1` `    ``first ``=` `A[``0``]` `    ``for` `j ``in` `range``(size_a):` `        ``# Check if A[j] > A``        ``if` `(A[j] > A[``0``]):``            ``break` `        ``# Check if A[j] < A``        ``if` `(A[j] < A[``0``]):``            ``answer ``+``=` `A``            ``A ``=` `""``            ``break` `    ``# Append the remaining characters``    ``# to the end of the result``    ``while` `(freq[``ord``(first)] > ``0``):``        ``answer.append(first)``        ``freq[``ord``(first)] ``-``=` `1` `    ``answer ``+``=` `A` `    ``for` `j ``in` `range``(``ord``(``'a'``), ``ord``(``'z'``) ``+` `1``):` `        ``# Push all the values from``        ``# frequency array in the answer``        ``while` `(freq[j]):``            ``answer.append(``chr``(j))``            ``freq[j] ``-``=` `1` `    ``# Return the answer``    ``return` `"".join(answer)` `# Driver Code``if` `__name__ ``=``=` `'__main__'``:``    ` `    ``# Given strings A and B``    ``A ``=` `"aa"``    ``B ``=` `"ababab"` `    ``# Function call``    ``print``(reorderString(A, B))` `# This code is contributed by mohit kumar 29`

## C#

 `// C# program for``// the above approach``using` `System;``class` `GFG{` `// Function to reorder the String B``// to contain all the subStrings of A``static` `String reorderString(``char` `[]A,``                            ``char` `[]B)``{``  ``// Find length of Strings``  ``int` `size_a = A.Length;``  ``int` `size_b = B.Length;` `  ``// Initialize array to count the``  ``// frequencies of the character``  ``int` `[]freq = ``new` `int``;` `  ``// Counting frequencies of``  ``// character in B``  ``for` `(``int` `i = 0; i < size_b; i++)``    ``freq[B[i]]++;` `  ``// Find remaining character in B``  ``for` `(``int` `i = 0; i < size_a; i++)``    ``freq[A[i]]--;` `  ``for` `(``int` `j = ``'a'``; j <= ``'z'``; j++)``  ``{``    ``if` `(freq[j] < 0)``      ``return` `"-1"``;``  ``}` `  ``// Declare the reordered String``  ``String answer = ``""``;` `  ``for` `(``int` `j = ``'a'``; j < A; j++)` `    ``// Loop until freq[j] > 0``    ``while` `(freq[j] > 0)``    ``{``      ``answer+=j;` `      ``// Decrement the value``      ``// from freq array``      ``freq[j]--;``    ``}` `  ``int` `first = A;` `  ``for` `(``int` `j = 0; j < size_a; j++)``  ``{``    ``// Check if A[j] > A``    ``if` `(A[j] > A)``      ``break``;` `    ``// Check if A[j] < A``    ``if` `(A[j] < A)``    ``{``      ``answer += String.Join(``""``, A);``      ``A = ``new` `char``[A.Length];``      ``break``;``    ``}``  ``}` `  ``// Append the remaining characters``  ``// to the end of the result``  ``while` `(freq[first] > 0)``  ``{``    ``answer += String.Join(``""``, (``char``)first);``    ``--freq[first];``  ``}` `  ``answer += String.Join(``""``, A);` `  ``for` `(``int` `j = ``'a'``; j <= ``'z'``; j++)` `    ``// Push all the values from``    ``// frequency array in the answer``    ``while` `(freq[j]-- > 0)``      ``answer += ((``char``)j);` `  ``// Return the answer``  ``return` `answer;``}` `// Driver Code``public` `static` `void` `Main(String[] args)``{``  ``// Given Strings A and B``  ``String A = ``"aa"``;``  ``String B = ``"ababab"``;` `  ``// Function Call``  ``Console.Write(reorderString(A.ToCharArray(),``                              ``B.ToCharArray()));``}``}` `// This code is contributed by Rajput-Ji`

## Javascript

 ``

Output:

`aaabbb`

Time Complexity: O(N)
Auxiliary Space: O(1)

My Personal Notes arrow_drop_up