Skip to main content

Bill Division HackerRank Solution in Java and Python with Explanation

Java and Python solution for Bill Division HackerRank problem

Java and Python solution for Bill Division HackerRank problem

Problem Description :

Two friends Anna and Brian, are deciding how to split the bill at a dinner. Each will only pay for the items they consume. Brian gets the check and calculates Anna's portion. You must determine if his calculation is correct.

For example, assume the bill has the following prices bill = [2, 4, 6]. Anna declines to eat item k = bill[2] which costs 6.  If Brian calculates the bill correctly, Anna will pay (2 + 4) / 2 = 3.  If he includes the cost of bill[2], he will calculate (2 + 4 + 6) / 2 = 6.  In the second case, he should refund 3 to anna.

Complete the bonAppetit function in the editor below. It should print Bon Appetit if the bill is fairly split. Otherwise, it should print the integer amount of money that Brian owes Anna. 

bonAppetit has the following parameter(s):

  • bill: an array of integers representing the cost of each item ordered
  • k: an integer representing the zero-based index of the item Anna doesn't eat
  • charged: the amount of money that Anna contributed to the bill

Example 1 :

Input :

size = 4
[3, 10, 2, 9]
k = 1 charged = 12

Output :

5

Example 2 :

Input :

size = 4
[3, 10, 2, 9]
k = 1 charged = 7

Output :

Bon Appetit

In this problem, we have to do sum of all numbers, minus Anna's declined item and split into 2. If split cost match with Anna paid to Brian then print "Bon Appetit" otherwise return overcharged price.

So lets jump on solution and its explanation.

Solution 1 : Bill Division Solution in Java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

    public static void bonAppetit(List<Integer> bill, int k, int charged) {
        
        int total = bill.stream().mapToInt(n -> n.intValue()).sum();
        int split = (total - bill.get(k)) / 2;
        
        if (split == charged) {
            System.out.println("Bon Appetit");
        } else {
            System.out.println(charged - split);
        }
    }


}

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        String[] firstMultipleInput = bufferedReader.readLine().replaceAll("\\s+$", "").split(" ");

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

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

        List<Integer> bill = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

        int b = Integer.parseInt(bufferedReader.readLine().trim());

        Result.bonAppetit(bill, k, b);

        bufferedReader.close();
    }
}

Code Explanation :

  • We have used Stream api for get sum of all list values. Store into int total variable.
  • Now minus the Anna's declined item from total sum and split into 2.
  • Now, if given Anna's charged and split value matches then print "Bon Appetit" otherwise print integer amount of money that Brian owes Anna. 

Solution 2 :  Bill Division Solution in Python

def bonAppetit(bill, k, charged):
     
    s = (sum(bill)- bill[k])/2
    if s == charged:
        print("Bon Appetit")
    else:
        print(int((sum(bill)/2)-s))


RECOMMENDED ARTICLES :

 

    

 

Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

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 last