Print all permutations with repetition of characters
Last Updated :
13 Sep, 2022
Given a string of length n, print all permutations of the given string. Repetition of characters is allowed. Print these permutations in lexicographically sorted order
Examples:
Input: AB
Output:
All permutations of AB with repetition are:
AA
AB
BA
BB
Input: ABC
Output:
All permutations of ABC with repetition are:
AAA
AAB
AAC
ABA
...
...
CCB
CCC
For an input string of size n, there will be n^n permutations with repetition allowed. The idea is to fix the first character at first index and recursively call for other subsequent indexes. Once all permutations starting with the first character are printed, fix the second character at first index. Continue these steps till last character. Thanks to PsychoCoder for providing the following C implementation.
C++
// C++ program to print all permutations
// with repetition of characters
#include <bits/stdc++.h>
#include<string.h>
using namespace std;
/* Following function is used by
the library qsort() function
to sort an array of chars */
int compare (const void * a, const void * b);
/* The main function that recursively
prints all repeated permutations of
the given string. It uses data[] to store all
permutations one by one */
void allLexicographicRecur (char *str, char* data,
int last, int index)
{
int i, len = strlen(str);
// One by one fix all characters at
// the given index and recur for
// the/ subsequent indexes
for ( i = 0; i < len; i++ )
{
// Fix the ith character at index
// and if this is not the last
// index then recursively call
// for higher indexes
data[index] = str[i] ;
// If this is the last index then
// print the string stored in
// data[]
if (index == last)
cout << data << endl;
else // Recur for higher indexes
allLexicographicRecur (str, data, last, index+1);
}
}
/* This function sorts input string,
allocate memory for data (needed
for allLexicographicRecur()) and
calls allLexicographicRecur() for
printing all permutations */
void allLexicographic(char *str)
{
int len = strlen (str) ;
// Create a temp array that will
// be used by allLexicographicRecur()
char *data = (char *) malloc (sizeof(char) * (len + 1)) ;
data[len] = '\0';
// Sort the input string so that
// we get all output strings in
// lexicographically sorted order
qsort(str, len, sizeof(char), compare);
// Now print all permutations
allLexicographicRecur (str, data, len-1, 0);
// Free data to avoid memory leak
free(data);
}
// Needed for library function qsort()
int compare (const void * a, const void * b)
{
return ( *(char *)a - *(char *)b );
}
// Driver code
int main()
{
char str[] = "ABC";
cout << "All permutations with repetition of "<<
str <<" are: "<<endl ;
allLexicographic(str);
return 0;
}
// This code is contributed by rathbhupendra
// C program to print all permutations with repetition
// of characters
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
/* Following function is used by the library qsort() function
to sort an array of chars */
int compare (const void * a, const void * b);
/* The main function that recursively prints all repeated
permutations of the given string. It uses data[] to store all
permutations one by one */
void allLexicographicRecur (char *str, char* data, int last, int index)
{
int i, len = strlen(str);
// One by one fix all characters at the given index and recur for
// the/ subsequent indexes
for ( i=0; i<len; i++ )
{
// Fix the ith character at index and if this is not the last
// index then recursively call for higher indexes
data[index] = str[i] ;
// If this is the last index then print the string stored in
// data[]
if (index == last)
printf("%s\n", data);
else // Recur for higher indexes
allLexicographicRecur (str, data, last, index+1);
}
}
/* This function sorts input string, allocate memory for data (needed
for allLexicographicRecur()) and calls allLexicographicRecur() for
printing all permutations */
void allLexicographic(char *str)
{
int len = strlen (str) ;
// Create a temp array that will be used by allLexicographicRecur()
char *data = (char *) malloc (sizeof(char) * (len + 1)) ;
data[len] = '\0';
// Sort the input string so that we get all output strings in
// lexicographically sorted order
qsort(str, len, sizeof(char), compare);
// Now print all permutations
allLexicographicRecur (str, data, len-1, 0);
// Free data to avoid memory leak
free(data);
}
// Needed for library function qsort()
int compare (const void * a, const void * b)
{
return ( *(char *)a - *(char *)b );
}
// Driver program to test above functions
int main()
{
char str[] = "ABC";
printf("All permutations with repetition of %s are: \n",
str);
allLexicographic(str);
return 0;
}
// Java program to print all permutations
// with repetition of characters
import java.util.Arrays;
class GFG
{
// The main function that recursively prints
// all repeated permutations of the given string.
// It uses data[] to store all permutations one by one
static void allLexicographicRecur(String str, char[] data,
int last, int index)
{
int length = str.length();
// One by one fix all characters at the given index
// and recur for the subsequent indexes
for (int i = 0; i < length; i++)
{
// Fix the ith character at index and if
// this is not the last index then
// recursively call for higher indexes
data[index] = str.charAt(i);
// If this is the last index then print
// the string stored in data[]
if (index == last)
System.out.println(new String(data));
else
allLexicographicRecur(str, data, last,
index + 1);
}
}
// This function sorts input string, allocate memory
// for data(needed for allLexicographicRecur()) and calls
// allLexicographicRecur() for printing all permutations
static void allLexicographic(String str)
{
int length = str.length();
// Create a temp array that will be used by
// allLexicographicRecur()
char[] data = new char[length + 1];
char[] temp = str.toCharArray();
// Sort the input string so that we get all
// output strings in lexicographically sorted order
Arrays.sort(temp);
str = new String(temp);
// Now print all permutations
allLexicographicRecur(str, data, length - 1, 0);
}
// Driver Code
public static void main(String[] args)
{
String str = "ABC";
System.out.printf("All permutations with " +
"repetition of %s are: \n", str);
allLexicographic(str);
}
}
// This code is contributed by
// sanjeev2552
# Python program to print all permutations with repetition
# of characters
def toString(List):
return ''.join(List)
# The main function that recursively prints all repeated
# permutations of the given string. It uses data[] to store
# all permutations one by one
def allLexicographicRecur (string, data, last, index):
length = len(string)
# One by one fix all characters at the given index and
# recur for the subsequent indexes
for i in range(length):
# Fix the ith character at index and if this is not
# the last index then recursively call for higher
# indexes
data[index] = string[i]
# If this is the last index then print the string
# stored in data[]
if index==last:
print (toString(data))
else:
allLexicographicRecur(string, data, last, index+1)
# This function sorts input string, allocate memory for data
# (needed for allLexicographicRecur()) and calls
# allLexicographicRecur() for printing all permutations
def allLexicographic(string):
length = len(string)
# Create a temp array that will be used by
# allLexicographicRecur()
data = [""] * (length+1)
# Sort the input string so that we get all output strings in
# lexicographically sorted order
string = sorted(string)
# Now print all permutations
allLexicographicRecur(string, data, length-1, 0)
# Driver program to test the above functions
string = "ABC"
print ("All permutations with repetition of " + string + " are:")
allLexicographic(string)
# This code is contributed to Bhavya Jain
// C# program to print all permutations
// with repetition of characters
using System;
public class GFG
{
// The main function that recursively prints
// all repeated permutations of the given string.
// It uses data[] to store all permutations one by one
static void allLexicographicRecur(String str, char[] data,
int last, int index)
{
int length = str.Length;
// One by one fix all characters at the given index
// and recur for the subsequent indexes
for (int i = 0; i < length; i++)
{
// Fix the ith character at index and if
// this is not the last index then
// recursively call for higher indexes
data[index] = str[i];
// If this is the last index then print
// the string stored in data[]
if (index == last)
Console.WriteLine(new String(data));
else
allLexicographicRecur(str, data, last,
index + 1);
}
}
// This function sorts input string, allocate memory
// for data(needed for allLexicographicRecur()) and calls
// allLexicographicRecur() for printing all permutations
static void allLexicographic(String str)
{
int length = str.Length;
// Create a temp array that will be used by
// allLexicographicRecur()
char[] data = new char[length + 1];
char[] temp = str.ToCharArray();
// Sort the input string so that we get all
// output strings in lexicographically sorted order
Array.Sort(temp);
str = new String(temp);
// Now print all permutations
allLexicographicRecur(str, data, length - 1, 0);
}
// Driver Code
public static void Main(String[] args)
{
String str = "ABC";
Console.Write("All permutations with " +
"repetition of {0} are: \n", str);
allLexicographic(str);
}
}
// This code is contributed by PrinciRaj1992
<script>
// JavaScript code to implement the approach
// The main function that recursively prints
// all repeated permutations of the given string.
// It uses data[] to store all permutations one by one
function allLexicographicRecur(str, data, last, index)
{
let length = str.length;
// One by one fix all letacters at the given index
// and recur for the subsequent indexes
for (let i = 0; i < length; i++)
{
// Fix the ith letacter at index and if
// this is not the last index then
// recursively call for higher indexes
data[index] = str[i];
// If this is the last index then print
// the string stored in data[]
if (index == last)
document.write(new String(data) + "<br/>");
else
allLexicographicRecur(str, data, last,
index + 1);
}
}
// This function sorts input string, allocate memory
// for data(needed for allLexicographicRecur()) and calls
// allLexicographicRecur() for printing all permutations
function allLexicographic(str)
{
let length = str.length;
// Create a temp array that will be used by
// allLexicographicRecur()
let data = new Array(length + 1);
let temp = str.split();
// Sort the input string so that we get all
// output strings in lexicographically sorted order
temp.sort();
str = new String(temp);
// Now print all permutations
allLexicographicRecur(str, data, length - 1, 0);
}
// Driver code
let str = "ABC";
document.write("All permutations with " +
"repetition of " + str + " are " + "<br/>");
allLexicographic(str);
// This code is contributed by sanjoy_62.
</script>
OutputAll permutations with repetition of ABC are:
AAA
AAB
AAC
ABA
ABB
ABC
ACA
ACB
ACC
BAA
BAB
BAC
BBA
BBB
BBC
BCA
BCB
BCC
CAA
CAB
CAC
CBA
CBB
CBC
CCA
CCB
CCC
Time Complexity: O(n^n)
Auxiliary Space: O(n)
Following is recursion tree for input string "AB". The purpose of recursion tree is to help in understanding the above implementation as it shows values of different variables.
data=""
/ \
/ \
index=0 index=0
i=0 i=1
data="A" data="B"
/ \ / \
/ \ / \
index=1 index=1 index=1 index=1
i=0 i=1 i=0 i=1
data="AA" data="AB" data="BA" data="BB"
In the above implementation, it is assumed that all characters of the input string are different. The implementation can be easily modified to handle the repeated characters. We have to add a preprocessing step to find unique characters (before calling allLexicographicRecur()).
Java Program to Print all Permutations with Repetition of Characters
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem