More Problems

• Rearrange an array into a wave-like pattern such that arr[0] ≥ arr[1] ≤ arr[2] ≥ arr[3]…
• Given an array, find the maximum sum of a subarray that contains at least one negative number.
• 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.