More Problems

• Check if an array can be partitioned into two subarrays where the sum of one subarray is twice the sum of the other.
• Find the largest subarray where all elements are multiples of a given number k.
• Given an array, find the subarray with the minimum product.
• Check if an array can be rearranged such that all prime numbers appear before composite numbers while maintaining relative order.
• Find the longest subarray where the sum of elements is equal to the product of the elements.
• Find the minimum number of swaps required to bring all elements smaller than a given number x together.
• Given an array, find the largest sum of a subarray with at least k distinct elements.
• Find the number of subarrays that contain at least one odd number.