The maximum subarray sum with one deletion does not appear to be faster than O(n²) even using sliding window. I can almost but not quite grasp a "dynamic programming" approach to speed it up aargh
Austin My stabs at the leetcode problems can be found here forums.craigslist.org