Javascript Program to Find Lexicographically minimum string rotation | Set 1

// A simple Javascript program to find 
// lexicographically minimum rotation
// of a given String

// This functionr return lexicographically 
// minimum rotation of str
function minLexRotation(str) {

    // Find length of given String
    let n = str.length;

    // Create an array of strings 
    // to store all rotations
    let arr = new Array(n);

    // Create a concatenation of 
    // String with itself
    let concat = str + str;

    // One by one store all rotations 
    // of str in array. A rotation is 
    // obtained by getting a substring of concat
    for (let i = 0; i < n; i++) {
        arr[i] = concat.substring(i, i + n);
    }

    // Sort all rotations
    arr.sort();

    // Return the first rotation 
    // from the sorted array
    return arr[0];
}

// Driver code
console.log(minLexRotation("GEEKSFORGEEKS"));
console.log(minLexRotation("GEEKSQUIZ"));
console.log(minLexRotation("BCABDADAB"));