Skip to main content

Designer PDF Viewer - HackerRank Problems

Difficulty: EASY
Problem :

The objective here is to find the size of the highlighted area, and we are given the size's of all the alphabets, we have to find the largest alphabet in the highlighted word and then calculate the size of the rectangle so if the tallest character is 3 then the size of the box will be 3 * number of characters given. Visual representation of the selection :


abc def ghij


Inputs

  1. An array with the sizes of all alphabets a-z in order.
  2. A String of highlighted words.


Important points to note

  • The array which holds the height of each character in ascending order

    which means the arrays 0th index will have the height of a 1st index will have the height of b and so on and so forth in the end the hight of z will be there so it's easy to locate each character.

  • A String with the highlighted word.

    This means we have got the characters inside the rectangle, all we have to find is the tallest one and half our problem is solved, here we have some knowledge of ASCII representation of characters if not I recommend you go through first and then join again.

  • All the alphabets inside the String are lower case.

    This means the ASCII values of the characters will start from 97 so if we decrement this value from the characters of the string we will get their index.

  • Only the tallest matter to us

    With the value from the array's index, we need only the tallest in the range of our characters inside the string, so we need only the highest value. for example, if our String is ="abc" and the array's values are{5,3,1,9..} we take only 5 coz it's the tallest of our string which is at index 0.

  • We need to return the size of the rectangle.

    Once we get the tallest character then we can multiply it by the length of the given String.

Algorithm

  • Initialize a variable tallest to zero
  • Loop through the character inside the given string
  • Inside the loop Initialize a variable index
  • Set the value of the index to the value - 97 (here value is the current character)
  • Compare the value from the ArrayList.get(index) to tallest
  • Update tallest if the value is greater.
  • Return tallest multiplied words length after the loop.

Below is the code implementation.

public static int designerPdfViewer(List <Integer> h, String word) {
int tallest = 0;

for (char c : word.toCharArray()) {
int index = c - 97;
if (h.get(index) > tallest)
tallest = h.get(index);
}

return tallest * word.length();
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Introduction to Primitives - Java

2. Overview: There are eight primitive data types byte, short, int, long, float, double boolean, char. These eight data types store values as raw instead of Objects these primitives help to save memory to a great extent and simplify other processes as they are directly stored in the stack. Data Type Size(in bits) Minimum Range Maximum Range byte 8 -128 127 short 16 -32768 32767 int 32 -2147483648 2147483647 long 64 -9223372036854775808 9223372036854775807 float 32 -3.4e38 to -1.4e-45 1.4e-45 to 3.4e38 double 64 -1.8e308 to -4.9e-324 4.9e-324 to 1.8e308 boolean 1 - - char 16 space 65535 byte A byte has the capacity of 8 bits or 1 byte and it can store numbers between -2 7 and 2 7 -1 or simply -128 to 127. This is very useful while deali...
Post a Comment
Read more

Chocolate Feast - Problem Solving - Hacker Rank Solution.

The expectation is to find the total number of choclate one can consume by taking full advantage of the offer, Here there are 3 inputs n which holds the value of initial amount of money for buying choclate, c is the cost price of each candy if paid by cash and m is the exchange rate for the candy. Inputs n Initial cash to buy candy. c Coast of each candy if paid by cas.h m Exchange rate for a new candy in offer. The initial count of choclate will be the cash / coast and the wrappers in hand will be the same value of choclate, and from there we loop through until the wrap count is less than the exchange rate, inside the loop the choclate count will still hold the same fourmula as before but divided with exchange rate. The wrap count is the tricky part... the wrap will be wrap/ exchange rate(the no. choclate) + the remainder of this division(THIS IS VERY IMPORTANT) because for example if the count of wrapper is 3 and the exchange rate is 2 you can only buy 1 c...
Post a Comment
Read more

Collection Interface - Java Collections Framework - DSA

Most people consider the collection as the root interface of Collections Framework and it is true to a great extent but another part of Collections Framework is Map Interface, we will see that later, Most Common methods which are applicable to all collections are defined in this interface for example add() to add an element, size() to get the size and much more, below is a table of most common methods. Hierarchey of the Collection Interface. The Parent of Collection Interface is Iterator Interface and the Collection is base class for List Interface, Set Interface and Queue Interface, the respective classes which impliments either of the sub classes will also implement the defined methods from the Collection Interface, below are some of the commonly used methods. Defined Methods: Method Description add() This method returns a Boolean value true if it inserts the specified element in this collection....
Post a Comment
Read more