Number of distinct permutation a String can have - GeeksforGeeks

27 Jan, 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!) = 1663200Below is the implementation of above idea.  
C++
Java
Python3
C#
Javascript
// 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 codeint 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 codest = "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>
Output:  
840
 
YouTubeGeeksforGeeks506K subscribersNumber of distinct permutation a String can have | GeeksforGeeksWatch laterShareCopy linkInfoShoppingTap to unmuteIf playback doesn't begin shortly, try restarting your device.You're signed outVideos you watch may be added to the TV's watch history and influence TV recommendations. To avoid this, cancel and sign in to YouTube on your computer.CancelConfirmMore videosMore videosSwitch cameraShareInclude playlistAn error occurred while retrieving sharing information. Please try again later.Watch on0:000:000:00 / 2:48•Live•<div class="player-unavailable"><h1 class="message">An error occurred.</h1><div class="submessage"><a href="https://www.youtube.com/watch?v=jBL2TIZ0dhc" target="_blank">Try watching this video on www.youtube.com</a>, or enable JavaScript if it is disabled in your browser.</div></div>
This article is contributed by Aditya Kumar. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above. 
parashar
vaibhavrabadiya117
amartyaghoshgfg
Combinatorial
Strings
Strings
Combinatorial
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Count of subsets with sum equal to X
Python program to get all subsets of given size of a set
Heap's Algorithm for generating permutations
Make all combinations of size k
Count Derangements (Permutation such that no element appears in its original position)
Write a program to reverse an array or string
Reverse a string in Java
Longest Common Subsequence | DP-4
C++ Data Types
Check for Balanced Brackets in an expression (well-formedness) using Stack