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.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.