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;
}

Comments

Continue reading my other posts

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

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 An array with the sizes of all alphabets a-z in order. 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

Delving Deeper into ViewModel - AndroidNotes

While building apps i have often incorporate ViewModels without fully grasping their intricacies. I made some common mistakes, like creating ViewModel instances within a remember block and such silly mistakes,but this journey has prompted me to dig a little deeper into understanding ViewModels and their internal workings. The primary questions we are going to address are as follows: What is a ViewModel? How to create a ViewModel? What is the difference between ViewModel and AndroidViewModel? What is a ViewModelFactory? What is viewModelScope? When is the ViewModel dropped by the ViewModelStore? What is onCleared() in the ViewModel ? lets begin our journey.... What is a ViewModel? ViewModel is a simple class that is part of the Android Architecture Components and its primary purpose is to store and manage UI-related data in a lifecycle-conscious manner caching its value during the lifecycle of the activity It helps us to avoid loading dat