Given an array of integers nums and a positive integer limit, determine the length of the longest subarray where the absolute difference between the minimum and maximum elements is less than or equal to limit.
You are given a string s consisting of lowercase English letters and an integer k. Your task is to find the maximum number of vowels in any substring of length k. Vowels in English are ‘a’, ’e’, ‘i’, ‘o’, and ‘u’.
You are given an array of integers arr and an integer target. You need to find two non-overlapping sub-arrays of arr each with a sum equal target. The goal is to minimize the sum of their lengths, and if no such sub-arrays exist, return -1.
Given a binary array nums, you should delete one element from it. After deleting one element, return the size of the longest non-empty subarray containing only 1’s in the resulting array. If no such subarray exists, return 0.
You are given a circular array ‘code’ and an integer ‘k’. To decrypt the code, you must replace every element in the array based on the value of k. If k > 0, replace the i-th element with the sum of the next k elements. If k < 0, replace the i-th element with the sum of the previous k elements. If k == 0, replace the i-th element with 0. The array is circular, meaning the next element of the last one is the first, and the previous element of the first one is the last.
You are given an array of integers nums and an integer x. In each operation, you can either remove the leftmost or rightmost element from the array and subtract its value from x. The task is to determine the minimum number of operations required to reduce x to exactly 0, or return -1 if it’s not possible.