Interview question of the issue #297 of rendezvous with cassidoo.
Given an array of integers, find whether it’s possible to construct an integer using all the digits of the numbers in the array such that it would be divisible by n (where n is 1 <= n <= 9). If it’s possible, return true, else return false.
Example:
> divisibleIntegers(n = 3, arr= [40, 50, 90])
> true // 945000 is divisible by 3Just pnpm i to install all dependencies and then pnpm t to run the tests!