Available question text
Count the permutations of 1..n such that for every position i, either perm[i] is divisible by i or i is divisible by perm[i]. With n ≤ 15 this is typically solved by exponential search with pruning (backtracking) or DP over subsets using bitmasks.
Related questions
Continue with questions that share topics or the same question type.
- Optimal Account Balancing
Coding · Array · Backtracking · Bit Manipulation
- Number of Ways to Wear Different Hats to Each Other
Coding · Array · Bipartite Graph · Bit Manipulation
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
- Smallest Sufficient Team
Coding · Array · Bit Manipulation · Bitmask
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 526. Beautiful Arrangement
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Rippling
Beautiful Arrangement
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 75.7. This is not an interview probability.
View source