← All problemsSign in

1770. Maximum Score from Performing Multiplication Operations

LeetCodeArrayDynamic ProgrammingOpen on judge ↗

You are given two 0-indexed integer arrays nums and multipliers of size n and m respectively, where n >= m. You begin with a score of 0. You want to perform exactly m operations. On the ith operation (0-indexed) you will: - Choose one integer x from either the start or the end of the array nums. - Add multipliers[i] * x to your score. - Note that multipliers[0] corresponds to the first operati

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start