Counts the number of contiguous subarrays that sum to exactly k. # Parameters - `nums`: A slice of integers - `k`: The target sum # Returns The number of contiguous subarrays with sum equal to k. # Complexity - Time: O(n) - Space: O(n)
(nums: &[i32], k: i32)