Algorithm · Waymo · Medium
Requirements Implement the following entry point: The function receives an integer array nums, which may contain negative numbers, a target value k, and a selector describing the requested variant. Depending on part, return the appropriate result, such as: whether a qualifying subarray exists; how many subarrays have sum k; the length or index-related result requested for the longest qualifying subarray; or how many subarrays have a sum divisible by k. The expected behavior…
Checking your access…