[3,6,2] and [2,6,3] are the two special permutations of nums.

Example 2:

Input: nums = [1,4,3]
Output: 2
Explanation: [3,1,4] and [4,1,3] are the two special permutations of nums.

Constraints:

2 <= nums.length <= 14
1 <= nums[i] <= 10⁹

23:T754,\n**GIVING TLE**\n \n```\nclass Solution {\npublic:\n int maxii=0;\n int mod=(1e9 + 7);\n void finp(vector &nums,vectords,int index){\n if(index==nums.size())\n {\n maxii=(maxii+1)%mod;\n return;\n }\n for(int i=index;i& nums) {\n \n vector ds;\n finp(nums,ds,0);\n return maxii;\n }\n};\n```\n\n\n**BIT Masking**\n\n\n```\nconstexpr int mod = (int)1e9 + 7;\nclass Solution {\npublic:\n int specialPerm(vector& nums) {\n int n = nums.size();\n vector> dp(1 << n, vector(n));\n for(int i = 0 ; i < n ; i++) dp[1 << i][i] = 1;\n \n for(int mask = 1 ; mask < (1 << n) ; mask++) {\n for(int i = 0 ; i < n ; i++) {\n if(mask >> i & 1 ^ 1) continue;\n for(int j = 0 ; j < n ; j++) {\n if(mask >> j & 1) continue;\n if(nums[j] % nums[i] == 0 || nums[i] % nums[j] == 0) {\n dp[mask | 1 << j][j] += dp[mask][i];\n if(dp[mask | 1 << j][j] >= m

Special Permutations

Problem Description

Problem Description

Answer Panel