// Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed). // Specifically, ans is the ...

int sum = 0, maxLen = 0; // sum = prefix sum which stores sum of every element, maxlen = maximum length of sub array maxLen = i + 1; // if k itself is present in the ...