Medium 0 solved 0% acceptance

Name Scores

Sort a list of names and add up each name's letter value times its position.

What you'll learn

  • Sort strings in character order
  • Convert letters to numbers
  • Weight values by their position

Problem

A raffle gives each name a score. First sort the names alphabetically. A name's letter value adds A = 1, B = 2, ..., Z = 26 over its letters, and its score is that value times its position in the sorted list, counting from 1.

Implement name_scores(names).

Sort by plain character order, so a name comes before any longer name that starts with it ("AA" before "AAB").

Input

names: Names in uppercase letters A to Z. The same name can appear more than once; each copy is scored at its own position.

Output

Return the total of all scores. An empty list returns 0.

Constraints

0 ≤ names.length ≤ 1000; 1 ≤ name length ≤ 20

Examples

Example 1
Input:
names = ["NORA", "ABE", "LIAM"]

Expected output:
expected = 222
Input:
std::vector<std::string> names = {"NORA", "ABE", "LIAM"};

Expected output:
long long expected = 222;
Input:
string[] names = new string[] {"NORA", "ABE", "LIAM"};

Expected output:
long expected = 222;

Explanation

Sorted: ABE (8) × 1, LIAM (35) × 2, NORA (48) × 3, total 8 + 70 + 144 = 222.

Example 2
Input:
names = ["ZOE", "AMY", "AMY"]

Expected output:
expected = 255
Input:
std::vector<std::string> names = {"ZOE", "AMY", "AMY"};

Expected output:
long long expected = 255;
Input:
string[] names = new string[] {"ZOE", "AMY", "AMY"};

Expected output:
long expected = 255;

Explanation

Sorted: AMY, AMY, ZOE. AMY is worth 39 and ZOE 46: 39 × 1 + 39 × 2 + 46 × 3 = 255.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Sort first, then score; the position depends on the sorted order.

Hint 2

A letter's value is its character code minus the code of 'A' plus 1.

Hint 3

Positions start at 1, not 0.

Expected complexity

O(n log n × L) time, O(n) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.