Topic: array-problem / Level: intermediate

• 1102. Rearrange an array into a wave-like pattern such that arr[0] ≥ arr[1] ≤ arr[2] ≥ arr[3]…
• 1103. Given an array, find the maximum sum of a subarray that contains at least one negative number.
• 1104. Check if an array can be partitioned into two subarrays where the sum of one subarray is twice the sum of the other.
• 1105. Find the largest subarray where all elements are multiples of a given number k.
• 1106. Given an array, find the subarray with the minimum product.
• 1107. Check if an array can be rearranged such that all prime numbers appear before composite numbers while maintaining relative order.
• 1108. Find the longest subarray where the sum of elements is equal to the product of the elements.
• 1109. Find the minimum number of swaps required to bring all elements smaller than a given number x together.
• 1110. Given an array, find the largest sum of a subarray with at least k distinct elements.
• 1111. Find the number of subarrays that contain at least one odd number.
• 1112. Find the smallest number of elements to remove from an array to make the remaining elements form a geometric progression.
• 1113. Find the longest subarray where all elements are divisible by both 2 and 3.
• 1114. Rearrange an array such that all even numbers appear before odd numbers, and all elements are sorted within their group.
• 1115. Check if an array contains a subarray where the product of elements is equal to a given number.
• 1116. Find the number of ways to partition an array into k subarrays such that the sum of elements in each subarray is equal.
• 1117. Check if it is possible to partition an array into two subarrays where the sum of elements in both is divisible by a given number.
• 1118. Find the number of pairs of elements in an array whose product is divisible by a given number k.
• 1119. Check if the array can be rearranged such that every element is greater than its immediate previous element.
• 1120. Find the number of ways to partition an array into three contiguous subarrays where the sum of elements in all subarrays is equal.
• 1121. Check if an array is a subsequence of another array using dynamic programming.
• 1122. Find the maximum possible value of the sum of elements in three non-overlapping subarrays.
• 1123. Check if all elements in an array can be made equal by multiplying or dividing by 2 or 3.
• 1124. Find the number of subarrays where the sum of elements is divisible by the number of elements in the subarray.
• 1125. Check if an array can be rearranged such that all even numbers appear before odd numbers using a two-pointer approach.
• 1126. Find the longest subarray where the sum of the elements is a multiple of the sum of their indices.
• 1127. Check if the array contains a subarray with an odd sum using hashing.
• 1128. Given an array, find the minimum number of operations required to make all elements distinct using only increments.
• 1129. Find the number of subarrays where the sum of elements is equal to the product of the elements.
• 1130. Rearrange an array such that the elements form a palindrome by making at most one adjacent swap.
• 1131. Find the number of subarrays where the sum of elements is divisible by their index.
• 1132. Check if an array can be rearranged into a zigzag pattern such that arr[0] ≤ arr[1] ≥ arr[2] ≤ arr[3]…
• 1133. Find the smallest subarray with at least two distinct elements using a sliding window.
• 1134. Find the minimum number of swaps required to sort an array of distinct integers using cycle decomposition.
• 1135. Check if an array can be divided into two subarrays where the sum of elements in both subarrays is a prime number.
• 1136. Find the minimum number of adjacent swaps required to turn an array into a palindrome.
• 1137. Find the longest subarray where all elements are either even or odd.
• 1138. Given an array, find the number of subarrays where the sum is divisible by their length.
• 1139. 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.
• 1140. Find the number of subarrays where the sum of elements is a perfect square.
• 1141. Find the maximum possible value of the product of two non-overlapping subarrays.
• 1142. Check if an array can be rearranged such that every element is divisible by the element before it.
• 1143. Find the minimum number of elements to remove from an array to make all remaining elements form an arithmetic progression.
• 1144. Find the number of ways to partition an array into k subarrays where the sum of elements in each subarray is a multiple of k.
• 1145. Check if an array can be rearranged into a strictly increasing sequence by reversing at most one subarray.
• 1146. Find the number of subarrays where the product of elements is divisible by their index.
• 1147. Check if an array is a palindrome using a two-pointer approach.
• 1148. Find the number of ways to partition an array into two subarrays where the sum of elements in one subarray is a multiple of the sum of elements in the other.
• 1149. Find the longest subarray where all elements are greater than or equal to the average of the array.
• 1150. Check if an array contains a subarray with the maximum product using a sliding window approach.
• 1151. Find the minimum number of operations required to make an array non-increasing by only decrementing elements.

• More Levels

• Beginner
• Advanced