How should I practice Maximum Move Score?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon phone screen problems in FastPrep.

Is Maximum Move Score associated with Amazon?

FastPrep tags this as a Amazon phone screen coding practice problem when the problem catalog has that company and stage context.

Maximum Move Score

Amazon● MediumNEW GRADPHONE SCREEN

Problem statement

You are given a string s, an array of distinct strings moves, and an integer array score, where score[i] is the number of points awarded for using moves[i].

Split s into consecutive, non-overlapping pieces whose concatenation is exactly s. Each piece is scored as follows:

The problem statement continues

Pro

Examples

Example 1

s = "SBXC"moves = ["S","SB","SBX","XC","C"]score = [3,10,12,8,5]return = 18

The split "SB" + "XC" earns 10 + 8 = 18 points.

For comparison, "SBX" + "C" earns 12 + 5 = 17, while "SB" + "X" + "C" earns 10 + 1 + 5 = 16.

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Amazon hiring insights