Skip to main content

Mark and Toys Hacker Rank In Java | Java Solution

Hacker Rank Mark and Toys Solution In Java

Mark and Toys Hacker Rank Solution In Java

Problem Statement :-

Mark and Jane are very happy after having their first child. Their son loves toys, so Mark wants to buy some. There are a number of different toys lying in front of him, tagged with their prices. Mark has only a certain amount to spend, and he wants to maximize the number of toys he buys with this money. Given a list of toy prices and an amount to spend, determine the maximum number of gifts he can buy.

Note : Each toy can be purchased only once. 

prices = [1,2,3,4]
k = 7

The budget is 7 units of currency. He can buy items that cost [1,2,3] for 6, or [3,4] for 7 units. The maximum is 3 items.

Example 1 :

Input :
prices = [1, 2, 3, 4]
k = 7

Output :
3

Explanation :
The budget is 7 units of currency. He can buy items that cost [1,2,3] for 6, or [3,4] for 7 units. The maximum is 3 items.

Example 2 :

Input :
prices = [20, 3, 10, 8, 1, 12, 5, 6]
k = 30

Output :
5

Explanation :
The budget is 30 units of currency. He can buy items that cost [1, 3, 5, 6, 8] for 23. The maximum is 5 items Mark can buy.

See description on Hacker Rank :-

So now lets see Solution of above problem.

For solution, first we have to Sort the array so it becomes easy to find maximum number of toys Mark can buy. 

We traverse through entire array and doing sum of numbers until we reach given k currency. Total sum can not be greater than given k currency. 

Solution 1 : Java code for Mark and Toys Problem

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

    // Complete the maximumToys function below.
    static int maximumToys(int[] priceArray, int price) {
       
        Arrays.sort(priceArray);
        
        int totalToys = 0;
        int totalToysPrice = 0;
        
        for (int i = 0; i < priceArray.length-1; i++) {
            if (price >= totalToysPrice) {
                totalToysPrice += priceArray[i];
                if (price >= totalToysPrice) {
                    totalToys++;
                }
            }
        }
        return totalToys;
    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) throws IOException {
        BufferedWriter bufferedWriter = new BufferedWriter(new
                FileWriter(System.getenv("OUTPUT_PATH")));

        String[] nk = scanner.nextLine().split(" ");

        int n = Integer.parseInt(nk[0]);

        int k = Integer.parseInt(nk[1]);

        int[] prices = new int[n];

        String[] pricesItems = scanner.nextLine().split(" ");
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        for (int i = 0; i < n; i++) {
            int pricesItem = Integer.parseInt(pricesItems[i]);
            prices[i] = pricesItem;
        }

        int result = maximumToys(prices, k);

        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();

        bufferedWriter.close();

        scanner.close();
    }
}

Explanation :-

  1. Sort the array using Arrays.sort(). so in array lesser value comes first and greater value last.
  2. Loop through Given prices array and sum the array value 1 by 1 into totalToys variable.
  3. Check if price is still less than sum of array values.
  4. Return totalToys.


Other HackerRank Problem And Solutions in Java :-

Spring boot Tutorials :-

Comments

Popular posts from this blog

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...