
Subarray Sum Equals K - LeetCode
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 of elements …
Make K-Subarray Sums Equal - LeetCode
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 Output: 1 …
Continuous Subarray Sum - LeetCode
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 least two, …
Maximum Size Subarray Sum Equals k - LeetCode
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 get …
862. Shortest Subarray with Sum at Least K - LeetCode
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 - LeetCode
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 - LeetCode
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.
560. Subarray Sum Equals K + condition: all numbers are ... - LeetCode
2025年8月4日 · 560. Subarray Sum Equals K + condition: all numbers are positive + constraint: space complexity O (1)
Subarray Sums Divisible by K - LeetCode
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.
Maximize the Confusion of an Exam - LeetCode
Return the maximum number of consecutive 'T's or 'F's in the answer key after performing the operation at most k times. Example 1: Input: answerKey = "TTFF", k = 2 Output: 4 Explanation: We can …