Count Divisible Permutations

Asked at Deloitte · Coding Questions · Difficulty: Medium

Suppose you have `n` integers from 1 through `n`. A permutation of those `n` integers is considered a **Divisible Permutation** if for every `i`, where `1 <= i <= n`, either of the following is true:

Loading the problem…