Javascript Program to Find Lexicographically minimum string rotation | Set 1

Javascript Program to Find Lexicographically minimum string rotation | Set 1

Last Updated : 19 Sep, 2024

Write code to find lexicographic minimum in a circular array, e.g. for the array BCABDADAB, the lexicographic minimum is ABBCABDAD.

Source: Google Written Test

Examples:

Input:  GEEKSQUIZ
Output: EEKSQUIZG

Input:  GFG
Output: FGG

Input:  GEEKSFORGEEKS
Output: EEKSFORGEEKSG

The following is a simple solution. Let the given string be 'str'

Concatenate 'str' with itself and store in a temporary string say 'concat'.
Create an array of strings to store all rotations of 'str'. Let the array be 'arr'.
Find all rotations of 'str' by taking substrings of 'concat' at index 0, 1, 2..n-1. Store these rotations in arr[]
Sort arr[] and return arr[0].

Following is the implementation of above solution.

JavaScript

// 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"));

Output

EEKSFORGEEKSG
EEKSQUIZG
ABBCABDAD

Time complexity of the above solution is O(n²Logn) under the assumption that we have used a O(nLogn) sorting algorithm.

Please refer complete article on Lexicographically minimum string rotation | Set 1 for more details!

Javascript Program to Find Lexicographically minimum string rotation | Set 1

kartik

Improve

Article Tags :

Practice Tags :

Strings

Similar Reads

DSA Tutorial - Learn Data Structures and Algorithms

DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on

QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s

Merge Sort - Data Structure and Algorithms Tutorials

Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge

Bubble Sort Algorithm

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir

Breadth First Search or BFS for a Graph

Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta

Data Structures Tutorial

Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st

Binary Search Algorithm - Iterative and Recursive Implementation

Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc

Insertion Sort Algorithm

Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T

Dijkstra's Algorithm to find Shortest Paths from a Source to all

Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example

Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an