More Problems

• 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.
• Find the longest subarray where all elements are either even or odd.
• Given an array, find the number of subarrays where the sum is divisible by their length.
• Check if the sum of all elements in the first half of an array is greater than the sum of elements in the second half.