Soluție HackerRank pentru Designer PDF Viewer. Include cerința formatată, exemple, explicația pașilor și cod sursă.

  • Problemă: Designer PDF Viewer

Cerinta completa

When a contiguous block of text is selected in a PDF viewer, the selection is highlighted with a blue rectangle. In this PDF viewer, each word is highlighted independently. For example:

PDF-highighting.png

There is a list of character heights aligned by index to their letters. For example, ‘a’ is at index and ‘z’ is at index . There will also be a string. Using the letter heights given, determine the area of the rectangle highlight in assuming all letters are wide.

Example

The heights are and . The tallest letter is high and there are letters. The hightlighted area will be so the answer is .

Function Description

Complete the designerPdfViewer function in the editor below.

designerPdfViewer has the following parameter(s):

  • int h[26]: the heights of each letter
  • string word: a string

Returns

  • int: the size of the highlighted area

Input Format

The first line contains space-separated integers describing the respective heights of each consecutive lowercase English letter, ascii[a-z].
The second line contains a single word consisting of lowercase English alphabetic letters.

Constraints

  • , where is an English lowercase letter.
  • contains no more than letters.

Sample Input 0

1 3 1 3 1 4 1 3 2 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5
abc

Sample Output 0

9

Explanation 0

We are highlighting the word abc:

Letter heights are , and . The tallest letter, b, is high. The selection area for this word is .

Note: Recall that the width of each character is .

Sample Input 1

1 3 1 3 1 4 1 3 2 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 7
zaba

Sample Output 1

28

Explanation 1

The tallest letter in is at . The selection area for this word is .

Limbajul de programare folosit: python3

Cod:

import sys

tokens = sys.stdin.read().strip().split()
heights = list(map(int, tokens[:26]))
word = tokens[26]
mx = max(heights[ord(ch)-97] for ch in word)
print(mx * len(word))

Scor obtinut: 1.0

Submission ID: 464552832

Link challenge: https://www.hackerrank.com/challenges/designer-pdf-viewer/problem

Designer PDF Viewer