Skip to main content

Breaking the Records - HackerRank- Problem Solving in Java

Difficulty : EASY
Problem :

Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for most points and least points in a game. Points scored in the first game establish her record for the season, and she begins counting from there.

Visual representation of the table

Game Score Minimum Maximum Count Min Count Max
0 12 12 12 0 0
1 24 12 24 0 1
2 10 10 24 1 1
3 24 10 24 1 1
Ouput : [1 , 2]

Imporant Points to note

  • We canculate the record determining her performance on Game 0(which is highlited in green) which will the value of minimum and maximum.
  • We change the value of maximum or minimum only if her score breaks our current record of maximim or minimum.
  • in case she breaks record then we increment the counter respectively.
  • return the Count max and Count min in the same order as a List.

Algorithm

  • inputs recived : List score ,int games
  • Set Min and Max to scores 1st element or 0th index element.
  • Loop through the scores from the 2nd element or the 1st index till the scores.size()-1
  • inside the above loop check if the value of current index is larger maximum if so then increase the counter of the maximum and get the value of the maximum to the current value.
  • else if statement to check if the value is smaller than current minimum if so then increase the counter of the minimum and set the value of minimum to the current value
  • outside the loop create an array and add the two value in the order of maxcount then min count and add the list to the return statement.

I Highly recommend you dont go through the below code now but try to solve it in your own to get the ability to solve problems but im just pasting it here for those who hasnt manged to find the solution despite many trys

List brakingTheRecord(List score)
{

 int currentMax = score.get(0);
 int currentMin = score.get(0);

int surpassed = 0;
int backlogged = 0;

 for(int index = 0 ;index < score.size(); index++)
 {
  if(score.get(index) > currentMax)
  {
   surpassed++;
   currentMax = score.get(index);
  }
  else if(score.get(index) < currentMin)
  {
    backlogged++;
    currentMin = score.get(index);
  }

}
List result = new ArrayList<>();
result.add( surpassed);
result.add( backlogged);
System.out.println(surpassed +" "+ backlogged);
return result;
}
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