solves designer pdf viewer

Author: anishLearnsToCode

README.md

@@ -92,7 +92,7 @@ I have also solved other domains on HackerRank that can be viewed at:
 | [Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/implimentation/PickingNumbers.java) |
 | [Climbing The Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/implimentation/ClimbingTheLeaderboard.java) |
 | [The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race) | Easy |  [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/hackerrank-algorithms/blob/master/src/implimentation/TheHurdleRace.java) |
-| [Designer PDF Viwer](https://www.hackerrank.com/challenges/designer-pdf-viewer) | Easy | |
+| [Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer) | Easy | |
 | [Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree) | Easy | |
 | [Angry Professor](https://www.hackerrank.com/challenges/angry-professor) | Easy | |
 | [Beautiful Days at the movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies) | Easy | |

src/implimentation/DesignerPdfViewer.java

@@ -0,0 +1,39 @@
+// https://www.hackerrank.com/challenges/designer-pdf-viewer/problem
+
+package implimentation;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Scanner;
+
+public class DesignerPdfViewer {
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) {
+        Map<Character, Integer> alphabetHeights = getAlphabetHeights();
+        String word = scanner.next();
+        System.out.println(area(word, alphabetHeights));
+    }
+
+    private static int area(String word, Map<Character, Integer> alphabetHeights) {
+        int maxHeight = getMaxHeight(word, alphabetHeights);
+        return maxHeight * word.length();
+    }
+
+    private static int getMaxHeight(String word, Map<Character, Integer> heights) {
+        int result = 0;
+        for (int index = 0 ; index < word.length() ; index++) {
+            char character = word.charAt(index);
+            result = Math.max(result, heights.get(character));
+        }
+        return result;
+    }
+
+    private static Map<Character, Integer> getAlphabetHeights() {
+        Map<Character, Integer> heights = new HashMap<>();
+        for (char character = 'a' ; character <= 'z' ; character++) {
+            heights.put(character, scanner.nextInt());
+        }
+        return heights;
+    }
+}