Subarray Sum Equals K - Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k. A subarray is a contiguous non-empty sequence …

Return the minimum number of operations such that the sum of each subarray of length k is equal. A subarray is a contiguous part of the array. Example 1: Input: arr = [1,4,1,3], k = 2 …

Continuous Subarray Sum - Given an integer array nums and an integer k, return true if nums has a good subarray or false otherwise. A good subarray is a subarray where: * its length is at …

Can you solve this real interview question? Maximum Size Subarray Sum Equals k - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and …

Shortest Subarray with Sum at Least K - Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k.

Binary Subarrays With Sum - Given a binary array nums and an integer goal, return the number of non-empty subarrays with a sum goal. A subarray is a contiguous part of the array.

Minimum Size Subarray Sum - Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target.

Aug 4, 2025 · 560. Subarray Sum Equals K + condition: all numbers are positive + constraint: space complexity O (1)

Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k. A subarray is a contiguous part of an array.

In addition, you are given an integer k, the maximum number of times you may perform the following operation: Change the answer key for any question to 'T' or 'F' (i.e., set answerKey[i] …