Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if an integer is rotation of another given integer

  • Difficulty Level : Hard
  • Last Updated : 26 Apr, 2021

Given two integers A and B, the task is to check if the integer A is rotation of the digits of the integer B or not. If found to be true, then print “Yes”. Otherwise print “No”.

Examples: 
 

Input: A= 976, B= 679
Output: Yes

Input: A= 974, B= 2345
Output: No

Approach: Follow the steps below to solve the problem:

  • If A == B, then print “Yes”.
  • Calculate the count of digits of integer present in the integer A and B in variables, say dig1 and dig2.
  • If dig1 != dig2 is found ot be true, then print “No”.
  • Initialize a variable, say temp. Assign temp = A.
  • Now, iterate and perform the following operations:

Below is the implementation of the above approach:

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if the integer
// A is a rotation of the integer B
int check(int A, int B)
{
 
    if (A == B) {
        return 1;
    }
 
    // Stores the count of digits in A
    int dig1 = floor(log10(A) + 1);
 
    // Stores the count of digits in B
    int dig2 = floor(log10(B) + 1);
 
    // If dig1 not equal to dig2
    if (dig1 != dig2) {
        return 0;
    }
 
    int temp = A;
 
    while (1) {
 
        // Stores position of first digit
        int power = pow(10, dig1 - 1);
 
        // Stores the first digit
        int firstdigit = A / power;
 
        // Rotate the digits of the integer
        A = A - firstdigit * power;
        A = A * 10 + firstdigit;
 
        // If A is equal to B
        if (A == B) {
            return 1;
        }
        // If A is equal to the initial
// value of integer A
        if (A == temp) {
            return 0;
        }
    }
}
 
// Driver Code
int main()
{
    int A = 967, B = 679;
 
    if (check(A, B))
        cout << "Yes";
    else
        cout << "No" << endl;
    return 0;
}
Java



// Java implementation of the approach
import java.io.*;
class GFG {
 
    // Function to check if the integer
    // A is a rotation of the integer B
    static int check(int A, int B)
    {
 
        if (A == B) {
            return 1;
        }
 
        // Stores the count of digits in A
        int dig1 = (int)Math.floor(Math.log10(A) + 1);
 
        // Stores the count of digits in B
        int dig2 = (int)Math.floor(Math.log10(B) + 1);
 
        // If dig1 not equal to dig2
        if (dig1 != dig2) {
            return 0;
        }
 
        int temp = A;
 
        while (true) {
 
            // Stores position of first digit
            int power = (int)Math.pow(10, dig1 - 1);
 
            // Stores the first digit
            int firstdigit = A / power;
 
            // Rotate the digits of the integer
            A = A - firstdigit * power;
            A = A * 10 + firstdigit;
 
            // If A is equal to B
            if (A == B) {
                return 1;
            }
            // If A is equal to the initial
            // value of integer A
            if (A == temp) {
                return 0;
            }
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        int A = 967, B = 679;
 
        if (check(A, B) == 1)
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}
 
// This code is contributed by Dharanendra L V.
Python3



# Python3 implementation of the approach
import math
 
# Function to check if the integer
# A is a rotation of the integer B
def check(A, B) :
  
    if (A == B) :
        return 1
  
    # Stores the count of digits in A
    dig1 = math.floor(math.log10(A) + 1)
  
    # Stores the count of digits in B
    dig2 = math.floor(math.log10(B) + 1)
  
    # If dig1 not equal to dig2
    if (dig1 != dig2) :
        return 0
  
    temp = A
  
    while (True) :
  
        # Stores position of first digit
        power = pow(10, dig1 - 1)
  
        # Stores the first digit
        firstdigit = A // power
  
        # Rotate the digits of the integer
        A = A - firstdigit * power
        A = A * 10 + firstdigit
  
        # If A is equal to B
        if (A == B) :
            return 1
         
        # If A is equal to the initial value of integer A
        if (A == temp) :
            return 0
           
          # Driver code
A, B = 967, 679
  
if (check(A, B)) :
    print("Yes")
else :
    print("No")
     
    # This code is contributed by divyesh072019.
C#



// C# implementation of the approach
using System;
public class GFG
{
 
    // Function to check if the integer
    // A is a rotation of the integer B
    static int check(int A, int B)
    {
        if (A == B)
        {
            return 1;
        }
 
        // Stores the count of digits in A
        int dig1 = (int)Math.Floor(Math.Log10(A) + 1);
 
        // Stores the count of digits in B
        int dig2 = (int)Math.Floor(Math.Log10(B) + 1);
 
        // If dig1 not equal to dig2
        if (dig1 != dig2)
        {
            return 0;
        }
        int temp = A;
        while (true)
        {
 
            // Stores position of first digit
            int power = (int)Math.Pow(10, dig1 - 1);
 
            // Stores the first digit
            int firstdigit = A / power;
 
            // Rotate the digits of the integer
            A = A - firstdigit * power;
            A = A * 10 + firstdigit;
 
            // If A is equal to B
            if (A == B)
            {
                return 1;
            }
           
            // If A is equal to the initial
            // value of integer A
            if (A == temp)
            {
                return 0;
            }
        }
    }
 
    // Driver Code
    public static void Main(String[] args)
    {
        int A = 967, B = 679;
        if (check(A, B) == 1)
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
}
 
// This code is contributed by 29AjayKumar
Javascript



<script>
    // Javascript implementation of the approach
     
    // Function to check if the integer
    // A is a rotation of the integer B
    function check(A, B)
    {
        if (A == B)
        {
            return 1;
        }
  
        // Stores the count of digits in A
        let dig1 = Math.floor(Math.log10(A) + 1);
  
        // Stores the count of digits in B
        let dig2 = Math.floor(Math.log10(B) + 1);
  
        // If dig1 not equal to dig2
        if (dig1 != dig2)
        {
            return 0;
        }
        let temp = A;
        while (true)
        {
  
            // Stores position of first digit
            let power = Math.pow(10, dig1 - 1);
  
            // Stores the first digit
            let firstdigit = parseInt(A / power, 10);
  
            // Rotate the digits of the integer
            A = A - firstdigit * power;
            A = A * 10 + firstdigit;
  
            // If A is equal to B
            if (A == B)
            {
                return 1;
            }
            
            // If A is equal to the initial
            // value of integer A
            if (A == temp)
            {
                return 0;
            }
        }
    }
     
    let A = 967, B = 679;
    if (check(A, B) == 1)
      document.write("Yes");
    else
      document.write("No");
   
  // This code is contributed by suresh07.
</script>
 
 
Output: 
Yes
 
Time Complexity: O(digit(N))
Auxiliary Space: O(1) 

My Personal Notes
arrow_drop_up
Previous
Calculate determinant of a Matrix using Pivotal Condensation Method
Next

Count trailing zeroes present in binary representation of a given number using XOR
Recommended Articles
Page :
Rotation of a point about another point in C++
01, Jul 17
Reflection of a point at 180 degree rotation of another point
22, May 18
Check if chords of a Circle are symmetric after some rotation
12, Aug 21
Modify given array to a non-decreasing array by rotation
22, Feb 21
Find a rotation with maximum hamming distance
15, Dec 17
Find determinant of matrix generated by array rotation
29, Nov 18
Longest subsequence of a number having same left and right rotation
25, Aug 20
Find a rotation with maximum hamming distance | Set 2
23, Jul 21
Rearrange array elements into alternate even-odd sequence by anticlockwise rotation of digits
28, Jan 21
Maximum number of 0s placed consecutively at the start and end in any rotation of a Binary String
12, Mar 21
Minimum number of flips with rotation to make binary string alternating
24, Aug 20
Digital Root (repeated digital sum) of square of an integer using Digital root of the given integer
01, Oct 20
Check if an array can be converted to another given array by swapping pairs of unequal elements
15, Feb 21
Check if a given value can be reached from another value in a Circular Queue by K-length jumps
06, Nov 20
Minimum decrements to make integer A divisible by integer B
27, Apr 20
Minimize operations to convert A to B by adding any odd integer or subtracting any even integer
13, Jan 22
Convert a given temperature to another system based on given boiling and freezing points
16, Jul 19
Minimize elements to be added to a given array such that it contains another given array as its subsequence | Set 2
12, Oct 20
Check if a number is divisible by all prime divisors of another number
18, Oct 17
Check if permutation of one string can break permutation of another
28, Jul 20
Check if matrix can be converted to another matrix by transposing square sub-matrices
12, Mar 19
Check if a circle lies inside another circle or not
15, May 19
Check if a number starts with another number or not
20, Jul 20
Check if each element of an Array is the Sum of any two elements of another Array
06, Aug 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
patelajeet
@patelajeet
Vote for difficulty
Current difficulty :
Hard





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!