Leetcode 1770. Maximum Score from Performing Multiplication Operations

Pick exactly m elements from either end of nums in order, adding multipliers[i] * chosen_value each step, to maximize the total score. The core challenge is designing a DP over the small parameter m (not n) that tracks how many picks came from the left vs right to choose the optimal sequence.