Leetcode 3410. Maximize Subarray Sum After Removing All Occurrences of One Element

Given an integer array, you may (at most once) choose a value x and remove all its occurrences (keeping the array non-empty); return the largest possible maximum subarray sum after that removal (or no removal). The core challenge is picking which value to delete—if any—to optimally merge or trim segments so as to maximize the Kadane-style subarray sum.