You are given a 0-indexed integer array
numscontainingndistinct positive integers. A permutation ofnumsis called special if:
- For all indexes
0 <= i < n - 1, eithernums[i] % nums[i+1] == 0ornums[i+1] % nums[i] == 0.Return the total number of special permutations. As the answer could be large, return it modulo
109 + 7.
2740. Find the Value of the Partition
You are given a positive integer array
nums.Partition
numsinto two arrays,nums1andnums2, such that:
- Each element of the array
numsbelongs to either the arraynums1or the arraynums2.- Both arrays are non-empty.
- The value of the partition is minimized.
The value of the partition is
|max(nums1) - min(nums2)|.Here,
max(nums1)denotes the maximum element of the arraynums1, andmin(nums2)denotes the minimum element of the arraynums2.Return the integer denoting the value of such partition.
A truck has two fuel tanks. You are given two integers,
mainTankrepresenting the fuel present in the main tank in liters andadditionalTankrepresenting the fuel present in the additional tank in liters.The truck has a mileage of
10km per liter. Whenever5liters of fuel get used up in the main tank, if the additional tank has at least1liters of fuel,1liters of fuel will be transferred from the additional tank to the main tank.Return the maximum distance which can be traveled.
Note: Injection from the additional tank is not continuous. It happens suddenly and immediately for every 5 liters consumed.