How should I practice Count Divisible Permutations?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Deloitte online assessment problems in FastPrep.

Is Count Divisible Permutations associated with Deloitte?

FastPrep tags this as a Deloitte coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Dynamic Programming

Count Divisible Permutations

● HardDeloitteNEW GRADOA

SDE-1

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:

perm[i] is divisible by i.

i is divisible by perm[i].

Given an integer n, find the total number of the valid Divisible Permutations.

Note - you may want to refer to LC 810

Examples

01 · Example 1

n = 2
return = 2

The first Divisible Permutation is [1,2]: permutation[1] = 1 is divisible by i = 1 permutation[2] = 2 is divisible by i = 2 The second Divisible Permutation is [2,1]: permutation[1] = 2 is divisible by i = 1 i = 2 is divisible by permutation[2] = 1

Constraints

1 <= n <= 15