More Problems

• Check if the product of elements in an array is a prime number using a brute force approach.
• Find the longest subarray where all elements are divisible by the product of their digit sum.
• Check if an array can be split into two subarrays where the sum of the first subarray is equal to the sum of the second subarray.
• Find the number of subarrays where the product of elements is a multiple of both 2 and 3.
• Check if the sum of elements in the first half of an array is greater than the product of elements in the second half.
• Find the number of ways to split an array into three subarrays such that the sum of elements in all subarrays is divisible by a given number k.
• Check if an array contains at least one subarray where the product of elements is a perfect cube.
• Find the longest subarray where the product of elements is divisible by both the sum of their index cubes and their digit cubes.