Given an array of integers `nums` and a target value `k` determine if the array contains a contiguous subarray such that the sum of the elements of this subarray is k\n\nEg,\nInput: nums=[6,1,3,-2,-1,3,5], k=2\nOutput: True\nExplanation:\n1+3-2=2=k\n\nInput: nums=[-1,2,6,-5], k=5\nOutput: False\nExplanation:\nNo such contiguous subarray exists\n\nSimilar to: https://leetcode.com/problems/subarray-sum-equals-k/

Given an array of integers nums and a target value k determine if the array contains a contiguous subarray such that the sum of the elements of this subarray is