More Problems

• Find the number of subarrays where the sum of elements is equal to the product of the elements.
• Rearrange an array such that the elements form a palindrome by making at most one adjacent swap.
• Find the number of subarrays where the sum of elements is divisible by their index.
• Check if an array can be rearranged into a zigzag pattern such that arr[0] ≤ arr[1] ≥ arr[2] ≤ arr[3]…
• Find the smallest subarray with at least two distinct elements using a sliding window.
• Find the minimum number of swaps required to sort an array of distinct integers using cycle decomposition.
• Check if an array can be divided into two subarrays where the sum of elements in both subarrays is a prime number.
• Find the minimum number of adjacent swaps required to turn an array into a palindrome.