Maximum adjacent index difference for a subsequence T present in given string S

Python3 Program to Find Mth element after K Right Rotations of an Array

Last Updated : 06 Sep, 2024

Python3

# Python3 program to implement
# the above approach

# Function to return Mth element of
# array after k right rotations
def getFirstElement(a, N, K, M):

    # The array comes to original state
    # after N rotations
    K %= N

    # If K is greater or equal to M
    if (K >= M):

        # Mth element after k right
        # rotations is (N-K)+(M-1) th
        # element of the array
        index = (N - K) + (M - 1)

    # Otherwise
    else:

        # (M - K - 1) th element
        # of the array
        index = (M - K - 1)

    result = a[index]

    # Return the result
    return result

# Driver Code
if __name__ == "__main__":
    
    a = [ 1, 2, 3, 4, 5 ]
    N = len(a)

    K , M = 3, 2

    print( getFirstElement(a, N, K, M))

# This code is contributed by chitranayal

Output

Time Complexity: O(1)
Auxiliary Space: O(1)

Please refer complete article on Mth element after K Right Rotations of an Array for more details!

Maximum adjacent index difference for a subsequence T present in given string S

kartik

Improve

Article Tags :

Practice Tags :

Similar Reads

Python3 Program to Find the Mth element of the Array after K left rotations

Given non-negative integers K, M, and an array arr[] with N elements find the Mth element of the array after K left rotations. Examples: Input: arr[] = {3, 4, 5, 23}, K = 2, M = 1Output: 5Explanation: The array after first left rotation a1[ ] = {4, 5, 23, 3}The array after second left rotation a2[ ]

Python Program to Print array after it is right rotated K times

Given an Array of size N and a value 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 5Explanation:After 1st rotation - {9, 1, 3, 5, 7}After 2nd rotation - {7, 9, 1, 3, 5}Input: Array[]

Python3 Program for Find element at given index after a number of rotations

An array consisting of N integers is given. There are several Right Circular Rotations of range[L..R] that we perform. After performing these rotations, we need to find element at a given index.Examples : Input : arr[] : {1, 2, 3, 4, 5} ranges[] = { {0, 2}, {0, 3} } index : 1Output : 3Explanation :

Python3 Program for Left Rotation and Right Rotation of a String

Given a string of size n, write functions to perform the following operations on a string- Left (Or anticlockwise) rotate the given string by d elements (where d <= n)Right (Or clockwise) rotate the given string by d elements (where d <= n).Examples: Input : s = "GeeksforGeeks" d = 2Output : L

Python3 Program for Reversal algorithm for right rotation of an array

Given an array, right rotate it by k elements.Â Â After K=3 rotationÂ Â Examples:Â Â Input: arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} k = 3Output: 8 9 10 1 2 3 4 5 6 7Input: arr[] = {121, 232, 33, 43 ,5} k = 2Output: 43 5 121 232 33Note : In the below solution, k is assumed to be smaller than or equal to

Python3 Program to Print all possible rotations of a given Array

Given an integer array arr[] of size N, the task is to print all possible rotations of the array.Examples: Input: arr[] = {1, 2, 3, 4} Output: {1, 2, 3, 4}, {4, 1, 2, 3}, {3, 4, 1, 2}, {2, 3, 4, 1} Explanation: Initial arr[] = {1, 2, 3, 4} After first rotation arr[] = {4, 1, 2, 3} After second rotat

Python3 Program for Search an element in a sorted and rotated array

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand. So for instance, 1 2 3 4 5 might become 3 4 5 1 2. Devise a way to find an element in the rotated array in O(log n) time. Examp

Python3 Program to Generate all rotations of a number

Given an integer n, the task is to generate all the left shift numbers possible. A left shift number is a number that is generated when all the digits of the number are shifted one position to the left and the digit at the first position is shifted to the last.Examples: Input: n = 123 Output: 231 31

Python3 Program to Find Range sum queries for anticlockwise rotations of Array by K indices

Given an array arr consisting of N elements and Q queries of the following two types: 1 K: For this type of query, the array needs to be rotated by K indices anticlockwise from its current state.2 L R: For this query, the sum of the array elements present in the indices [L, R] needs to be calculated

Python3 Program to Count of rotations required to generate a sorted array

Given an array arr[], the task is to find the number of rotations required to convert the given array to sorted form.Examples: Input: arr[] = {4, 5, 1, 2, 3} Output: 2 Explanation: Sorted array {1, 2, 3, 4, 5} after 2 anti-clockwise rotations. Input: arr[] = {2, 1, 2, 2, 2} Output: 1 Explanation: So