Leetcode 1175. Prime Arrangements
Count permutations of 1..n where every prime number appears at a prime (1-based) index ā equivalently, with p = number of primes ā¤ n, compute p! * (nāp)! modulo 10^9+7. Constraint: 1 ā¤ n ā¤ 100.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.