# Javascript Program to Check if all array elements can be converted to pronic numbers by rotating digits

Given an array arr[] of size N, the task is to check if it is possible to convert all of the array elements to a pronic number by rotating the digits of array elements any number of times.

Examples:

Input: {321, 402, 246, 299}Â
Output: TrueÂ
Explanation:Â
arr[0] ? Right rotation once modifies arr[0] to 132 (= 11 Ã— 12).Â
arr[1] ? Right rotation once modifies arr[0] to 240 (= 15 Ã— 16).Â
arr[2] ? Right rotation twice modifies arr[2] to 462 (= 21 Ã— 22).Â
arr[3] ? Right rotation twice modifies arr[3] to 992 (= 31 Ã— 32).

Input: {433, 653, 402, 186}
Output: False

Approach: Follow the steps below to solve the problem:

• Traverse the array and check for each array element, whether it is possible to convert it to a pronic number.
• For each array element, apply all the possible rotations and check after each rotation, whether the generated number is pronic or not.
• If it is not possible to convert any array element to a pronic number, print “False”.
• Otherwise, print “True”.

Below is the implementation of the above approach:

## Javascript

 ``

Output:Â
`True`

Â

Time Complexity: O(N3/2)
Auxiliary Space: O(1)

Please refer complete article on Check if all array elements can be converted to pronic numbers by rotating digits for more details!

Previous
Next