Number of distinct permutation a String can have
Last Updated :
12 Jul, 2022
We are given a string having only lowercase alphabets. The task is to find out total number of distinct permutation can be generated by that string.
Examples:
Input : aab
Output : 3
Different permutations are "aab",
"aba" and "baa".
Input : ybghjhbuytb
Output : 1663200
A simple solution is to find all the distinct permutation and count them.
We can find the count without finding all permutation. Idea is to find all the characters that is getting repeated, i.e., frequency of all the character. Then, we divide the factorial of the length of string by multiplication of factorial of frequency of characters.
In second example, number of character is 11 and here h and y are repeated 2 times whereas g is repeated 3 times.
So, number of permutation is 11! / (2!2!3!) = 1663200
Below is the implementation of above idea.
C++
// C++ program to find number of distinct
// permutations of a string.
#include<bits/stdc++.h>
using namespace std;
const int MAX_CHAR = 26;
// Utility function to find factorial of n.
int factorial(int n)
{
int fact = 1;
for (int i = 2; i <= n; i++)
fact = fact * i;
return fact;
}
// Returns count of distinct permutations
// of str.
int countDistinctPermutations(string str)
{
int length = str.length();
int freq[MAX_CHAR];
memset(freq, 0, sizeof(freq));
// finding frequency of all the lower case
// alphabet and storing them in array of
// integer
for (int i = 0; i < length; i++)
if (str[i] >= 'a')
freq[str[i] - 'a']++;
// finding factorial of number of appearances
// and multiplying them since they are
// repeating alphabets
int fact = 1;
for (int i = 0; i < MAX_CHAR; i++)
fact = fact * factorial(freq[i]);
// finding factorial of size of string and
// dividing it by factorial found after
// multiplying
return factorial(length) / fact;
}
// Driver code
int main()
{
string str = "fvvfhvgv";
printf("%d", countDistinctPermutations(str));
return 0;
}
// Java program to find number of distinct
// permutations of a string.
public class GFG {
static final int MAX_CHAR = 26;
// Utility function to find factorial of n.
static int factorial(int n)
{
int fact = 1;
for (int i = 2; i <= n; i++)
fact = fact * i;
return fact;
}
// Returns count of distinct permutations
// of str.
static int countDistinctPermutations(String str)
{
int length = str.length();
int[] freq = new int[MAX_CHAR];
// finding frequency of all the lower case
// alphabet and storing them in array of
// integer
for (int i = 0; i < length; i++)
if (str.charAt(i) >= 'a')
freq[str.charAt(i) - 'a']++;
// finding factorial of number of appearances
// and multiplying them since they are
// repeating alphabets
int fact = 1;
for (int i = 0; i < MAX_CHAR; i++)
fact = fact * factorial(freq[i]);
// finding factorial of size of string and
// dividing it by factorial found after
// multiplying
return factorial(length) / fact;
}
// Driver code
public static void main(String args[])
{
String str = "fvvfhvgv";
System.out.println(countDistinctPermutations(str));
}
}
// This code is contributed by Sumit Ghosh
# Python program to find number of distinct
# permutations of a string.
MAX_CHAR = 26
# Utility function to find factorial of n.
def factorial(n) :
fact = 1;
for i in range(2, n + 1) :
fact = fact * i;
return fact
# Returns count of distinct permutations
# of str.
def countDistinctPermutations(st) :
length = len(st)
freq = [0] * MAX_CHAR
# finding frequency of all the lower
# case alphabet and storing them in
# array of integer
for i in range(0, length) :
if (st[i] >= 'a') :
freq[(ord)(st[i]) - 97] = freq[(ord)(st[i]) - 97] + 1;
# finding factorial of number of
# appearances and multiplying them
# since they are repeating alphabets
fact = 1
for i in range(0, MAX_CHAR) :
fact = fact * factorial(freq[i])
# finding factorial of size of string
# and dividing it by factorial found
# after multiplying
return factorial(length) // fact
# Driver code
st = "fvvfhvgv"
print (countDistinctPermutations(st))
# This code is contributed by Nikita Tiwari.
// C# program to find number of distinct
// permutations of a string.
using System;
public class GFG {
static int MAX_CHAR = 26;
// Utility function to find factorial of n.
static int factorial(int n)
{
int fact = 1;
for (int i = 2; i <= n; i++)
fact = fact * i;
return fact;
}
// Returns count of distinct permutations
// of str.
static int countDistinctPermutations(String str)
{
int length = str.Length;
int[] freq = new int[MAX_CHAR];
// finding frequency of all the lower case
// alphabet and storing them in array of
// integer
for (int i = 0; i < length; i++)
if (str[i] >= 'a')
freq[str[i] - 'a']++;
// finding factorial of number of appearances
// and multiplying them since they are
// repeating alphabets
int fact = 1;
for (int i = 0; i < MAX_CHAR; i++)
fact = fact * factorial(freq[i]);
// finding factorial of size of string and
// dividing it by factorial found after
// multiplying
return factorial(length) / fact;
}
// Driver code
public static void Main(String []args)
{
String str = "fvvfhvgv";
Console.Write(countDistinctPermutations(str));
}
}
// This code is contributed by parashar.
<script>
// Javascript program to find number of distinct
// permutations of a string.
let MAX_CHAR = 26;
// Utility function to find factorial of n.
function factorial(n)
{
let fact = 1;
for (let i = 2; i <= n; i++)
fact = fact * i;
return fact;
}
// Returns count of distinct permutations
// of str.
function countDistinctPermutations(str)
{
let length = str.length;
let freq = new Array(MAX_CHAR);
freq.fill(0);
// finding frequency of all the lower case
// alphabet and storing them in array of
// integer
for (let i = 0; i < length; i++)
if (str[i].charCodeAt() >= 'a'.charCodeAt())
freq[str[i].charCodeAt() - 'a'.charCodeAt()]++;
// finding factorial of number of appearances
// and multiplying them since they are
// repeating alphabets
let fact = 1;
for (let i = 0; i < MAX_CHAR; i++)
fact = fact * factorial(freq[i]);
// finding factorial of size of string and
// dividing it by factorial found after
// multiplying
return parseInt(factorial(length) / fact, 10);
}
let str = "fvvfhvgv";
document.write(countDistinctPermutations(str));
// This code is contributed by vaibhavrabadiya117.
</script>
Time Complexity: O(n), where n is the length of the string
Auxiliary Space: O(n), where n is the length of the string
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In 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
4 min read
Sorting Algorithms A 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