More Problems

• Check if the array contains a subsequence that forms a geometric progression.
• Find the longest subarray where all elements are either prime or composite.
• Rearrange an array such that every even-indexed element is smaller than the odd-indexed element.
• Find the number of subarrays where the sum of elements is greater than the sum of their indices.
• Check if an array contains a subarray with a sum equal to the sum of its indices.
• Find the number of ways to split an array into two non-empty subarrays where the product of the first subarray is greater than the product of the second subarray.
• Find the longest subarray where all elements are divisible by a given number k.
• Given an array, find the number of ways to split it into three contiguous subarrays where the sum of elements in each subarray is a multiple of a given number k.