Given an array of integers `nums` of size `n`, and an int `k`. Return an array `result` of size `n` such that `result[i] = nums[max(0, i-k+1)] * ... * nums[i]`. In other words, each element is the product formed from a sliding window of size `k`, possibly cut short by the left side of the array.\n\n**Example:**\n```\nInput: nums = [1, 3, 3, 6, 5, 7, 0, -3], k = 3\nOutput: [1, 3, 9, 54, 90, 210, 0, 0]\nExplanation: 1 (1), 3 (1x3), 9 (1x3x3), 54 (3x3x6), 90 (3x6x5), 210 (6x5x7), 0 (5x7x0), 0 (7x0x-3)\n```\n\nQuestions from the same interview:\n* [Chunked Palindrome](https://leetcode.com/discuss/interview-question/337515/Google-or-Onsite-or-Chunked-Palindrome)

Given an array of integers nums of size n, and an int k. Return an array result of size n such that result[i] = nums[max(0, i-k+1)] * ... * nums[i]. In other wo