Permutations of Strings in C Hacker Rank Solution

Hello coders, In this post, you will learn how to solve the Permutations of Strings in C Hacker Rank Solution. This problem is a part of the HackerRank C Programming Series.

Permutations of Strings in C Hacker Rank Solution
Permutations of Strings in C Hacker Rank Solution

Permutations of Strings in C Hacker Rank Solution


Strings are usually ordered in lexicographical order. That means they are ordered by comparing their leftmost different characters. For example abc < abd, because c < d. Also z > yyy because z > y. If one string is an exact prefix of the other it is lexicographically smaller, e.g., gh < ghij.

Given an array of strings sorted in lexicographical order, print all of its permutations in strict lexicographical order. If two permutations look the same, only print one of them. See the ‘note’ below for an example.

Complete the function next_permutation which generates the permutations in the described order.

For example, s = [ab, bc, cd]. The six permutations in correct order are:

ab bc cd
ab cd bc
bc ab cd
bc cd ab
cd ab bc
cd bc ab

Note: There may be two or more of the same string as elements of s.
For example, s = [ab, ab, bc]. Only one instance of a permutation where all elements match should be printed. In other words, if s[0]==s[1] , then print either s[0] s[1] or s[1] s[0] but not both.

A three element array having three discrete elements has six permutations as shown above. In this case, there are three matching pairs of permutations where s[0] = ab and a[1] = ab are switched. We only print the three visibly unique permutations:

ab ab bc
ab bc ab
bc ab ab

Input Format :

The first line of each test file contains a single integer n, the length of the string array s.
Each of the next n lines contains a string s[i].

Constraints :

  • 2<=n<=9
  • a<=s[i]<=10
  • s[i] contains only lowercase English letters.

Output Format :

Print each permutation as a list of space-separated strings on a single line.

Sample Input 0 :


Sample Output 0 :

ab cd
cd ab

Sample Input 1 :


Sample Output 1 :

a bc bc
bc a bc
bc bc a

Explanation 1

This is similar to the note above. Only three of the six permutations are printed to avoid redundancy in output.

Permutations of Strings in C Hacker Rank Solution

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void swap(char **s, int i, int j)
    char * tmp = s[i];
    s[i] = s[j];
    s[j] = tmp;
void reverse(char **s, int start, int end)
int next_permutation(int n, char **s)
	for(int i=n-2;i>-1;i--)
            //get min max
            for(int j=n-1;j>i;j--)
                    //do swap
                    // do reverse
                    return 1;
    return 0;
int main()
	char **s;
	int n;
	scanf("%d", &n);
	s = calloc(n, sizeof(char*));
	for (int i = 0; i < n; i++)
		s[i] = calloc(11, sizeof(char));
		scanf("%s", s[i]);
		for (int i = 0; i < n; i++)
			printf("%s%c", s[i], i == n - 1 ? '\n' : ' ');
	} while (next_permutation(n, s));
	for (int i = 0; i < n; i++)
	return 0;

Disclaimer: The above Problem (Permutations of Strings in C) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.

Sharing Is Caring

Leave a Comment