Find smallest string with whose characters all given Strings can be generated

C++ Program to Print array after it is right rotated K times

Last Updated : 25 Jan, 2022

Given an Array of size N and a values K, around which we need to right rotate the array. How to quickly print the right rotated array?
Examples :

Input: Array[] = {1, 3, 5, 7, 9}, K = 2.
Output: 7 9 1 3 5
Explanation:
After 1st rotation - {9, 1, 3, 5, 7}
After 2nd rotation - {7, 9, 1, 3, 5}

Input: Array[] = {1, 2, 3, 4, 5}, K = 4.
Output: 2 3 4 5 1

Approach:

We will first take mod of K by N (K = K % N) because after every N rotations array will become the same as the initial array.
Now, we will iterate the array from i = 0 to i = N-1 and check,
- If i < K, Print rightmost Kth element (a[N + i -K]). Otherwise,
- Print array after ‘K’ elements (a[i – K]).

Below is the implementation of the above approach.

C++

// C++ implementation of right rotation  
// of an array K number of times 
#include<bits/stdc++.h> 
using namespace std; 
  
// Function to rightRotate array 
void RightRotate(int a[], int n, int k) 
{ 
      
    // If rotation is greater  
    // than size of array 
    k = k % n; 
  
    for(int i = 0; i < n; i++) 
    { 
       if(i < k) 
       { 
             
           // Printing rightmost  
           // kth elements 
           cout << a[n + i - k] << " "; 
       } 
       else
       { 
             
           // Prints array after 
           // 'k' elements 
           cout << (a[i - k]) << " "; 
       } 
    } 
    cout << " 
"; 
} 
      
// Driver code 
int main() 
{ 
    int Array[] = { 1, 2, 3, 4, 5 }; 
    int N = sizeof(Array) / sizeof(Array[0]); 
    int K = 2; 
      
    RightRotate(Array, N, K); 
} 
  
// This code is contributed by Surendra_Gangwar 

Output:

4 5 1 2 3

Time complexity : O(n)
Auxiliary Space : O(1)

Please refer complete article on Print array after it is right rotated K times for more details!

Find smallest string with whose characters all given Strings can be generated

kartik

Improve

Article Tags :

Practice Tags :

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

C++ Programming Language

C++ is a computer programming language developed by Bjarne Stroustrup as an extension of the C language. It is known for is fast speed, low level memory management and is often taught as first programming language. It provides: Hands-on application of different programming concepts.Similar syntax to

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. How do

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

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 fi

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). Conditions to apply Binary Search Algorithm in a Data S

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

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

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 a