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.
Input: n = 123
Output: 231 312
Input: n = 1445
Output: 4451 4514 5144
- Assume n = 123.
- Multiply n with 10 i.e. n = n * 10 = 1230.
- Add the first digit to the resultant number i.e. 1230 + 1 = 1231.
- Subtract (first digit) * 10k from the resultant number where k is the number of digits in the original number (in this case, k = 3).
- 1231 – 1000 = 231 is the left shift number of the original number.
Below is the implementation of the above approach:
4451 4514 5144
- Check whether all the rotations of a given number is greater than or equal to the given number or not
- Find element at given index after a number of rotations
- Generate all cyclic permutations of a number
- Generate number with given operation and check if it is palindrome
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Count rotations of N which are Odd and Even
- Count rotations divisible by 8
- Count rotations divisible by 4
- Check if two numbers are bit rotations of each other or not
- Check if strings are rotations of each other or not | Set 2
- Maximum sum of i*arr[i] among all rotations of a given array
- Generating numbers that are divisor of their right-rotations
- Minimum rotations required to get the same string
- Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.