Skip to content
Related Articles
Open in App
Not now

Related Articles

Lexicographic rank of a string using STL

Improve Article
Save Article
  • Difficulty Level : Easy
  • Last Updated : 15 Jul, 2022
Improve Article
Save Article

You are given a string, find its rank among all its permutations sorted lexicographically. 


Input : str[] = "acb"
Output : Rank = 2

Input : str[] = "string"
Output : Rank = 598

Input : str[] = "cba"
Output : Rank = 6

We have already discussed solutions to find Lexicographic rank of string In this post, we use the STL function “next_permutation ()” to generate all possible permutations of the given string and, as it gives us permutations in lexicographic order, we will put an iterator to find the rank of each string. While iterating when Our permuted string becomes identical to the original input string, we break from the loop and the iterator value for the last iteration is our required result. 



// C++ program to print rank of
// string using next_permute()
#include <bits/stdc++.h>
using namespace std;
// Function to print rank of string
// using next_permute()
int findRank(string str)
    // store original string
    string orgStr = str;
    // Sort the string in lexicographically
    // ascending order
    sort(str.begin(), str.end());
    // Keep iterating until
    // we reach equality condition
    long int i = 1;
    do {
        // check for nth iteration
        if (str == orgStr)
    } while (next_permutation(str.begin(), str.end()));
    // return iterator value
    return i;
// Driver code
int main()
    string str = "GEEKS";
    cout << findRank(str);
    return 0;



Time Complexity: O(n log n)
Auxiliary Space: O(1)

This article is contributed by Aarti_Rathi and Shivam Pradhan (anuj_charm). If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks. 

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!