Skip to main content

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 choclate but the remainder 1 will not be included and will pop errors in the test cases.

Algorithm

  • declare 2 new variables choclate and wrappers.
  • Initilize the choclate to n/m.
  • Initilize the wrapper to choclate.
  • Run a while loop until the wraper &ls;= exchange rate(or m)
  • Add the value of choclate to wrapper/exchange rate(or m)
  • Set the value of wrapper to the number of choclates exchanged and the balance un-used wrapper.
  • return the count of choclates consumed.

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 hasn't manged to find the solution despite many trys 

  	public static int chocolateFeast(int n, int c, int m) {
		int cho = n / c, wrap = cho;
		
		while (wrap >= m) {
			cho += wrap / m;
			wrap = wrap / m + wrap % m;

		}

		return cho;
	}
Labels:

Comments

Post a Comment

Continue reading my other posts

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
Post a Comment
Read more

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
Post a Comment
Read more