1 - https://leetcode.com/problems/valid-palindrome-ii/\n2 - Given an integer array and a target, return if there is a continous subarray whose sum is equal to k. No negatives.\n\nSolved the 1st question in completely. For the second, I first implemented O(n^2). Then, using prefix sum I tried to come up with sliding window solution but failed to do so. Optimal solution has O(n) time and O(1) space complexity. I couldn\'t even get O(n) time and O(n) space.\n\nLondon

1 - https://leetcode.com/problems/valid-palindrome-ii/\n2 - Given an integer array and a target, return if there is a continous subarray whose sum is equal to k