PHP Program to check if strings are rotations of each other or not

PHP Program to Check Whether All Rotations of a Given Number is Greater than or Equal to the Given Number or Not

Last Updated : 22 Jul, 2024

Given an integer x, the task is to find if every k-cycle shift on the element produces a number greater than or equal to the same element.

A k-cyclic shift of an integer x is a function that removes the last k digits of x and inserts them in its beginning. For example, the k-cyclic shifts of 123 are 312 for k=1 and 231 for k=2. Print Yes if the given condition is satisfied else print No.

Examples:

Input: x = 123 
Output : Yes 
Explanations: The k-cyclic shifts of 123 are 312 for k = 1 and 231 for k = 2. 
Both 312 and 231 are greater than 123.

Input: 2214 
Output: No 
Explanations: The k-cyclic shift of 2214 when k = 2 is 1422 which is smaller than 2214

Simple Approach

Find all the possible k-cyclic shifts of the number and check if all are greater than the given number or not.

Below is the implementation of the above approach:

PHP

<?php
// PHP program to implement above approach

function CheckKCycles($n, $s) {
    $ff = true;
    $x = 0;
    for ($i = 1; $i < $n; $i++) {

        // Splitting the number at index i 
        // and adding to the front 
        $x = strlen(substr($s, $i).substr($s, 0, $i));

        // Checking if the value is greater than 
        // or equal to the given value 
        if ($x >= strlen($s)) {
            continue;
        }
        $ff = false;
        break;
    }
    if ($ff) {
        print("Yes");
    }
    else {
        print("No");
    }
}

// Driver code
$n = 3;
$s = "123";

CheckKCycles($n, $s);

?>

Output

Yes

Time Complexity: O(N²), where N is the length of the given string. First it runs a loop for traversing the string and inside that substring function is used. So, the code will run in O(N²) time.

Auxiliary Space: O(1), no extra space required, so it is a constant.

Please refer complete article on Check whether all the rotations of a given number is greater than or equal to the given number or not for more details!

PHP Program to check if strings are rotations of each other or not

kartik

Improve

Article Tags :

Practice Tags :

Similar Reads

PHP Program to Check if Two Numbers are Bit Rotations of Each Other or Not

Given two positive integers x and y, check if one integer is obtained by rotating bits of other. Input constraint: 0 < x, y < 2^32 Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end. More inf

PHP 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 3

PHP Program to Check if all rows of a matrix are circular rotations of each other

Given a matrix of n*n size, the task is to find whether all rows are circular rotations of each other or not. Examples: Input: mat[][] = 1, 2, 3 3, 1, 2 2, 3, 1Output: Yes ,All rows are rotated permutation of each other.Input: mat[3][3] = 1, 2, 3 3, 2, 1 1, 3, 2Output: No, Explanation : As 3, 2, 1 i

PHP Program to check if strings are rotations of each other or not

Given a string s1 and a string s2, write a snippet to say whether s2 is a rotation of s1? (eg given s1 = ABCD and s2 = CDAB, return true, given s1 = ABCD, and s2 = ACBD , return false) Algorithm:areRotations(str1, str2): 1. Create a temp string and store concatenation of str1 to str1 in temp. temp =

PHP Program to Find Maximum Value of Sum ( i*arr[i]) with Only Rotations on Given Array Allowed

Given an array, only rotation operation is allowed on array. We can rotate the array as many times as we want. Return the maximum possible summation of i*arr[i]. Examples: Input: Arr = [ 1, 20, 2, 10 ] Output: 72 We can get 72 by rotating array twice. {2, 10, 1, 20} 20*3 + 1*2 + 10*1 + 2*0 = 72 Inpu

PHP Program to Arrange given numbers to form the biggest number

Given an array of numbers, arrange them in a way that yields the largest value. For example, if the given numbers are {54, 546, 548, 60}, the arrangement 6054854654 gives the largest value. And if the given numbers are {1, 34, 3, 98, 9, 76, 45, 4}, then the arrangement 998764543431 gives the largest

PHP Program to Check a Given Year is a Leap Year or Not

A leap year is a year that is divisible by 4, except for years that are divisible by 100. However, years divisible by 400 are also considered leap years. In this article, we will explore different approaches to create a PHP program that determines whether a given year is a leap year or not. Using Co

PHP Program to Check if it is possible to sort the array after rotating it

Given an array of size N, the task is to determine whether its possible to sort the array or not by just one shuffle. In one shuffle, we can shift some contiguous elements from the end of the array and place it in the front of the array. For example. A = {2, 3, 1, 2}, we can shift {1, 2} from the en

PHP Program to Rearrange positive and negative numbers in O(n) time and O(1) extra space

An array contains both positive and negative numbers in random order. Rearrange the array elements so that positive and negative numbers are placed alternatively. Number of positive and negative numbers need not be equal. If there are more positive numbers they appear at the end of the array. If the

PHP Program to Convert Integer to Roman Number

Converting an integer to a Roman number is a common problem often encountered in applications dealing with dates, historical data, and numeral representations. In this article, we will explore various approaches to converting an integer to Roman numerals in PHP. Table of Content Using Simple Mapping