{"id":27099,"date":"2018-01-05T20:46:58","date_gmt":"2018-01-05T15:16:58","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27099"},"modified":"2018-01-05T20:46:58","modified_gmt":"2018-01-05T15:16:58","slug":"c-programming-lexicographically-minimum-string-rotation","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-programming-lexicographically-minimum-string-rotation\/","title":{"rendered":"C++ Programming – Lexicographically minimum string rotation"},"content":{"rendered":"

Write code to find lexicographic minimum in a circular array, e.g. for the array BCABDADAB, the lexicographic minimum is ABBCABDAD.<\/span><\/p>\n

Source: Google Written Test<\/p>\n

More Examples:<\/p>\n

Input:  GEEKSQUIZ\r\nOutput: EEKSQUIZG\r\n\r\nInput:  GFG\r\nOutput: FGG\r\n\r\nInput:  GEEKSFORGEEKS\r\nOutput: EEKSFORGEEKSG<\/pre>\n
Following is a simple solution. Let the given string be \u2018str\u2019
\n1) Concatenate \u2018str\u2019 with itself and store in a temporary string say \u2018concat\u2019.
\n2) Create an array of strings to store all rotations of \u2018str\u2019. Let the array be \u2018arr\u2019.
\n3) Find all rotations of \u2018str\u2019 by taking substrings of \u2018concat\u2019 at index 0, 1, 2..n-1. Store these rotations in arr[]\n4) Sort arr[] and return arr[0].<\/p>\n[ad type=”banner”]\n
Following is C++ implementation of above solution.<\/p>\n
 
 C++ Program<\/span> <\/div> 
\/\/ A simple C++ program to find lexicographically minimum rotation\/\/ of a given string#include <iostream>#include <algorithm>using namespace std; \/\/ This functionr return lexicographically minimum\/\/ rotation of strstring minLexRotation(string str){    \/\/ Find length of given string    int n = str.length();     \/\/ Create an array of strings to store all rotations    string arr[n];     \/\/ Create a concatenation of string with itself    string concat = str + str;     \/\/ One by one store all rotations of str in array.    \/\/ A rotation is obtained by getting a substring of concat    for (int i = 0; i < n; i++)        arr[i] = concat.substr(i, n);     \/\/ Sort all rotations    sort(arr, arr+n);     \/\/ Return the first rotation from the sorted array    return arr[0];} \/\/ Driver program to test above functionint main(){    cout << minLexRotation("GEEKSFORGEEKS") << endl;    cout << minLexRotation("GEEKSQUIZ") << endl;    cout << minLexRotation("BCABDADAB") << endl;}<\/code><\/pre> <\/div>\n
Output:<\/p>\n
EEKSFORGEEKSG\r\nEEKSQUIZG\r\nABBCABDAD<\/pre>\n
Time complexity of the above solution is O(n2<\/sup>Logn) under the assumption that we have used a O(nLogn) sorting algorithm.<\/p>\n
This problem can be solved using more efficient methods like Booth\u2019s Algorithm<\/a> which solves the problem in O(n) time. We will soon be covering these methods as separate posts.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Write code to find lexicographic minimum in a circular array, e.g. for the array BCABDADAB, the lexicographic minimum is ABBCABDAD.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,83515,1],"tags":[80802,73394,73654,75696,75706,80812,73634,80808,80803,75705,73676,70384,73652,80806,80809,80807,72138,71159,73184,73636,73653,80810],"class_list":["post-27099","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-c-programming-3","category-coding","tag-c-words","tag-compare-strings-in-c","tag-competitive-programming-3-pdf","tag-dictionary-order","tag-dictionary-program-in-c","tag-enumeration-grammar","tag-example-of-suffix","tag-good-string","tag-hackerrank-test","tag-ordered-dictionary","tag-permutation","tag-permutation-program-in-c","tag-prefixes-and-suffixes-pdf","tag-programming-dictionary","tag-radix-64","tag-smallest-string","tag-sort-dictionary","tag-sorting-program","tag-string-algorithms","tag-suffix","tag-suffix-of-or","tag-universal-cycles"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27099","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27099"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27099\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27099"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27099"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27099"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}