Topic: array-problem / Level: intermediate

• 1051. Find the number of ways to partition an array into k subarrays such that the sum of each subarray is equal.
• 1052. Given an array, find the subarray with the maximum product using a dynamic programming approach.
• 1053. Find the longest subarray whose sum is a multiple of a given integer k.
• 1054. Rearrange an array such that every element is greater than the element before it and smaller than the element after it.
• 1055. Find the number of subarrays where the product of elements is odd.
• 1056. Find the minimum sum of a subarray that contains at least k elements.
• 1057. Given an array, find the minimum number of operations required to make all elements distinct by incrementing or decrementing them.
• 1058. Find the kth largest sum of a subarray using a min-heap.
• 1059. Check if a given array can be sorted using only adjacent swaps where each swap operation is between two adjacent elements.
• 1060. Given an array, find the smallest subarray that contains all the distinct elements of the array.
• 1061. Given an array of integers, check if it is possible to sort the array by reversing exactly one subarray.
• 1062. Find the minimum number of operations required to reduce an array to strictly increasing order by only increasing the elements.
• 1063. Find the number of subarrays whose product is divisible by a given integer.
• 1064. Given an array, find the minimum number of adjacent swaps required to sort the array.
• 1065. Check if an array can be divided into k subarrays where the sum of each subarray is equal.
• 1067. Given an array, find the minimum number of moves required to equalize the elements in the array using increment or decrement operations.
• 1068. Find the smallest window (subarray) that contains all unique elements from a given set of elements.
• 1069. Find the maximum difference between the sum of elements in two non-overlapping subarrays of size k.
• 1070. Check if the array contains a subarray where the sum of elements is equal to a given number using the sliding window technique.
• 1071. Find the number of ways to split an array into k non-empty contiguous subarrays where the sum of elements in each subarray is equal.
• 1072. Check if the array can be rearranged such that all even-indexed elements are greater than the odd-indexed elements.
• 1073. Find the minimum number of operations required to turn an array into a mountain array (increasing then decreasing).
• 1074. Given an array, find the number of ways to split it into two subarrays where the sum of elements in both subarrays is a prime number.
• 1075. Find the maximum number of pairs of elements in an array such that the sum of each pair is divisible by a given integer k.
• 1076. Given an array, find the maximum length of a subarray where the sum of elements is divisible by a given number.
• 1077. Check if it is possible to sort an array into non-decreasing order by reversing at most one subarray.
• 1078. Find the longest subsequence of an array such that the difference between consecutive elements is the same.
• 1079. Given an array, find the minimum number of elements to remove so that the remaining elements form an arithmetic progression.
• 1080. Find the minimum number of moves required to make all elements of an array equal by incrementing or decrementing adjacent elements.
• 1081. Find the maximum possible value of the sum of two non-overlapping subarrays in an array.
• 1082. Check if the sum of elements in any subarray of size k is equal to a given number using a sliding window approach.
• 1083. Given an array, rearrange it in such a way that all even numbers come before odd numbers while maintaining relative order.
• 1084. Find the maximum difference between two elements in an array such that the larger element comes after the smaller element.
• 1085. Find the longest contiguous subarray with exactly k distinct elements using a sliding window and hashing technique.
• 1086. Given an array, find the number of subarrays where the product of elements is less than a given value.
• 1087. Check if an array can be rearranged into a palindrome by swapping adjacent elements.
• 1088. Find the length of the longest increasing subarray in an array.
• 1089. Find the number of ways to partition an array into three contiguous subarrays such that the sum of each subarray is the same.
• 1090. Check if a given array is a rotation of another array using binary search.
• 1091. Find the smallest subarray with a sum greater than or equal to a given number using a sliding window technique.
• 1092. Find the minimum number of operations required to turn an array into a non-decreasing sequence.
• 1093. Find the kth largest sum of subarrays in an array using a min-heap and sliding window approach.
• 1094. Rearrange an array such that all elements greater than the pivot are on the right side, and all elements smaller are on the left.
• 1095. Find the smallest number that is missing from an unsorted array using O(n) time and O(1) space.
• 1096. Check if an array contains a pair of numbers that sum to a given value using a two-pointer approach.
• 1097. Given an array, find the largest sum of non-overlapping subarrays of size k.
• 1098. Find the smallest subarray with at least k distinct elements using a sliding window technique.
• 1099. Given an array of n elements, find the number of ways to partition it into two subarrays where the sum of the left subarray is greater than the sum of the right subarray.
• 1100. Find the smallest contiguous subarray whose sum is equal to a given number using binary search.
• 1101. Find the number of subarrays where the sum of elements is greater than the product of the elements.

• More Levels

• Beginner
• Advanced