More Problems

• Check if an array can be rearranged such that all prime numbers appear before all composite numbers, keeping their relative order intact.
• Find the number of subarrays where the sum of elements is a multiple of both the first and last elements of the array.
• Check if an array contains at least one subarray with a sum greater than the product of its elements.
• Find the maximum sum of a subarray where all elements are greater than the sum of their neighbors.
• Find the number of subarrays where the product of elements is divisible by their squared sum.
• Check if the sum of elements at prime indices in an array is greater than their product using a two-pointer approach.
• Find the longest subarray where the sum of elements is less than the product of their index sum.
• Check if an array can be rearranged such that the sum of elements at even indices is smaller than the sum of elements at odd indices.