Leetcode 2606. Find the Substring With Maximum Cost

Map each character in s to an integer value (use vals when the char appears in chars, otherwise its 1-indexed alphabet position). Then find the maximum contiguous subarray sum (empty substring allowed, so result ≥ 0) — solvable with Kadane's algorithm in O(n).