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
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- 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
- Number of strings which starts and ends with same character after rotations
- Generate all cyclic permutations of a number
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Generate number with given operation and check if it is palindrome
- Count rotations of N which are Odd and Even
- Maximum sum of i*arr[i] among all rotations of a given array
- Count rotations divisible by 4
- Check if strings are rotations of each other or not | Set 2
- Count rotations which are divisible by 10
- Check if two numbers are bit rotations of each other or not
- Count rotations divisible by 8
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Generating numbers that are divisor of their right-rotations