© 2026 LinearBytes Inc.
Search posts, tags, users, and pages
yetanothertroll
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
Software Engineer
I think if you're reaching an O(n^2) solution, something must be going wrong.
Good luck though, if it can be done in BASIC, you're the one to figure it out!
Austin I think I can once I understand Kaldane's algorithm thoroughly. :)
Austin My stabs at the leetcode problems can be found here forums.craigslist.org