Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2992. Number of Self-Divisible Permutations
Count how many permutations of 1..n satisfy that for every position i the placed value and i are "self-divisible" (e.g., the value divides i or i divides the value). This requires exploring combinatorial assignments efficiently—typically via backtracking with pruning or bitmask DP—because n is small but the search space is factorial.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.