Compute maximum beauty of a string

Q: Compute maximum beauty of a string

This is a Coding & Algorithms interview question from Bank of America for Data Scientist roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a string s, define the beauty of each letter a–z as a distinct integer between 1 and 26, case-insensitive. The beauty of a string is the sum over letters of (letter beauty × its frequency). Ignore punctuation and spaces. For each input line containing a string, compute and print the maximum possible beauty by choosing an assignment of beauties to letters that maximizes the sum. Examples: Input "ABbCCC" → 152; Input "Ignore punctuation, please :)" → 491.

Compute maximum beauty of a string

Comments (0)