More Problems

• Check if an array can be divided into k parts such that the sum of elements in each part is a prime number.
• Find the number of distinct subsequences of an array.
• Given an array, find the smallest subarray that contains the largest element in the array.
• 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.