Beautiful Arrangement
Suppose you have n
integers labeled 1
through n
. A permutation of those n
integers perm
(1-indexed) is considered a beautiful arrangement if for every i
(1 <= i <= n
), either of the following is true:
perm[i]
is divisible byi
.i
is divisible byperm[i]
.
Given an integer n
, return the number of the beautiful arrangements that you can construct.
Example 1:
Input: n = 2
Output: 2
Explanation:
The first beautiful arrangement is [1,2]
:
- perm[1] = 1
is divisible by i = 1
- perm[2] = 2
is divisible by i = 2
The second beautiful arrangement is [2,1]
:
- perm[1] = 2
is divisible by i = 1
- i = 2
is divisible by perm[2] = 1
Example 2:
Input: n = 1
Output: 1
Constraints:
1 <= n <= 15
Solution
Since this problem asks for the number of beautiful solutions, we will use the aggregation template for backtracking. We will fill in the logic.
- additional state:
unvisited
to store unused numbers. is_leaf
:i == n+1
, all then
numbers are used.get_edges
: all of the numbers from1
ton
is_valid
:not visited[num] and i % num == 0 or num % i == 0
, check whethernum
is unused andnum
is beautiful for indexi
.
Implementation
1def countArrangement(self, n: int) -> int:
2 visited = [False] * (n+1)
3 def findBeautiful(i):
4 if i == n+1:
5 return 1
6 count = 0
7 for num in range(1, n+1):
8 if (not visited[num]) and (i % num == 0 or num % i == 0):
9 visited[num] = True
10 count += findBeautiful(i + 1)
11 visited[num] = False
12 return count
13 return findBeautiful(1)
Which of the following is a min heap?
Solution Implementation
Which data structure is used in a depth first search?
Recommended Readings
Patterns The Shortest Path Algorithm for Coding Interviews The goal of AlgoMonster is to help you get a job in the shortest amount of time possible in a data driven way We compiled datasets of tech interview problems and broke them down by patterns This way we can determine the
Recursion Recursion is one of the most important concepts in computer science Simply speaking recursion is the process of a function calling itself Using a real life analogy imagine a scenario where you invite your friends to lunch https algomonster s3 us east 2 amazonaws com recursion jpg You first
Runtime Overview When learning about algorithms and data structures you'll frequently encounter the term time complexity This concept is fundamental in computer science and offers insights into how long an algorithm takes to complete given a certain input size What is Time Complexity Time complexity represents the amount of time
Got a question? Ask the Monster Assistant anything you don't understand.
Still not clear? Ask in the Forum,  Discord or Submit the part you don't understand to our editors.