Topic: array-problem / Level: intermediate

• 1152. Check if an array can be split into k subarrays where the sum of each subarray is equal to a given value.
• 1153. Find the longest subarray where the difference between the maximum and minimum elements is less than a given value.
• 1154. Given an array, find the maximum sum of a subarray that has at least two distinct elements.
• 1155. Find the number of ways to split an array into three non-empty subarrays where the sum of the first subarray is equal to the sum of the third subarray.
• 1156. Check if an array can be divided into k parts such that the sum of elements in each part is a prime number.
• 1157. Find the number of distinct subsequences of an array.
• 1158. Given an array, find the smallest subarray that contains the largest element in the array.
• 1159. Check if the array contains a subsequence that forms a geometric progression.
• 1160. Find the longest subarray where all elements are either prime or composite.
• 1161. Rearrange an array such that every even-indexed element is smaller than the odd-indexed element.
• 1162. Find the number of subarrays where the sum of elements is greater than the sum of their indices.
• 1163. Check if an array contains a subarray with a sum equal to the sum of its indices.
• 1164. Find the number of ways to split an array into two non-empty subarrays where the product of the first subarray is greater than the product of the second subarray.
• 1165. Find the longest subarray where all elements are divisible by a given number k.
• 1166. Given an array, find the number of ways to split it into three contiguous subarrays where the sum of elements in each subarray is a multiple of a given number k.
• 1167. Check if an array contains at least one subarray with all even numbers.
• 1168. Find the number of subarrays where the sum of elements is equal to the sum of their squares.
• 1169. Given an array, find the maximum sum of any two non-overlapping subarrays of size k.
• 1170. Find the number of distinct subarrays in an array.
• 1171. Check if the sum of elements in an array is a Fibonacci number.
• 1172. Given an array, find the number of contiguous subarrays where the sum of elements is a prime number.
• 1173. Find the number of pairs of elements in an array whose difference is equal to a given number.
• 1174. Rearrange an array into alternating positive and negative numbers while maintaining their relative order.
• 1175. Check if an array can be rearranged such that all positive numbers are followed by all negative numbers without changing the relative order.
• 1176. Find the number of subarrays where the sum of elements is greater than the product of elements.
• 1177. Given an array, find the maximum product of any two distinct elements.
• 1178. Find the number of ways to split an array into k subarrays where the sum of elements in each subarray is equal to a given number x.
• 1179. Check if the array contains a subarray where the sum of elements is equal to the sum of the first and last elements.
• 1180. Find the number of subarrays where the product of elements is a perfect square.
• 1181. Rearrange an array such that every element is smaller than or equal to the sum of its neighbors.
• 1182. Find the smallest subarray with a product greater than or equal to a given value x.
• 1183. Check if all elements in an array are divisible by their index using a brute force approach.
• 1184. Find the number of subarrays where the sum of elements is equal to a given number using hashing.
• 1185. Given an array, check if it contains a subarray where the sum of elements is a multiple of a given number k.
• 1186. Find the longest subarray where the sum of elements is divisible by the number of elements in the subarray.
• 1187. Check if the sum of elements in an array is greater than the product of all elements using a sliding window technique.
• 1188. Find the number of subarrays where the product of elements is divisible by the sum of elements.
• 1189. Given an array, find the longest subarray where the sum of elements is less than the sum of the first and last elements of the array.
• 1190. Check if an array can be divided into k parts where the sum of elements in each part is a perfect square.
• 1191. Find the number of subarrays where the sum of elements is greater than the cube of the length of the subarray.
• 1192. Rearrange an array such that every element is a multiple of its index using a sorting technique.
• 1193. Check if an array contains at least two subarrays with equal sums using hashing.
• 1194. Find the longest subarray where the product of elements is greater than the product of the first and last elements of the array.
• 1195. Check if an array can be split into two parts such that the sum of elements in both parts is divisible by a given number x.
• 1196. Find the number of subarrays where the product of elements is greater than their sum using a dynamic programming approach.
• 1197. Rearrange an array into a strictly increasing sequence by reversing at most one subarray using a two-pointer approach.
• 1198. Check if the sum of elements in an array is divisible by the product of the first and last elements using a sliding window technique.
• 1199. Find the number of ways to partition an array into k subarrays where the sum of elements in each subarray is a perfect cube.
• 1200. Check if an array contains a subarray with the maximum sum using dynamic programming.
• 1201. Find the number of subarrays where the sum of elements is less than the sum of their squared values.

• More Levels

• Beginner
• Advanced