Hacker Rank Price Check Solution

 import java.io.*;

import java.util.*;

import java.util.stream.*;


class Result {


    /*

     * Complete the 'priceCheck' function below.

     *

     * The function is expected to return an INTEGER.

     * The function accepts following parameters:

     *  1. STRING_ARRAY products

     *  2. FLOAT_ARRAY productPrices

     *  3. STRING_ARRAY productSold

     *  4. FLOAT_ARRAY soldPrice

     */


    public static int priceCheck(List<String> products, List<Float> productPrices, List<String> productSold, List<Float> soldPrice) {

        // A map to store product names and their corresponding prices

        Map<String, Float> priceMap = new HashMap<>();

        

        // Populate the map with products and their prices

        for (int i = 0; i < products.size(); i++) {

            priceMap.put(products.get(i), productPrices.get(i));

        }

        

        // Count the number of price mismatches

        int mismatches = 0;

        for (int i = 0; i < productSold.size(); i++) {

            String soldProduct = productSold.get(i);

            float recordedPrice = soldPrice.get(i);

            

            // Check if the sold price is different from the actual product price

            if (priceMap.containsKey(soldProduct) && !priceMap.get(soldProduct).equals(recordedPrice)) {

                mismatches++;

            }

        }

        

        return mismatches;

    }


}


public class Solution {

    public static void main(String[] args) throws IOException {

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));


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


        List<String> products = IntStream.range(0, productsCount).mapToObj(i -> {

            try {

                return bufferedReader.readLine();

            } catch (IOException ex) {

                throw new RuntimeException(ex);

            }

        }).collect(Collectors.toList());


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


        List<Float> productPrices = IntStream.range(0, productPricesCount).mapToObj(i -> {

            try {

                return bufferedReader.readLine().replaceAll("\\s+$", "");

            } catch (IOException ex) {

                throw new RuntimeException(ex);

            }

        }).map(String::trim)

          .map(Float::parseFloat)

          .collect(Collectors.toList());


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


        List<String> productSold = IntStream.range(0, productSoldCount).mapToObj(i -> {

            try {

                return bufferedReader.readLine();

            } catch (IOException ex) {

                throw new RuntimeException(ex);

            }

        }).collect(Collectors.toList());


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


        List<Float> soldPrice = IntStream.range(0, soldPriceCount).mapToObj(i -> {

            try {

                return bufferedReader.readLine().replaceAll("\\s+$", "");

            } catch (IOException ex) {

                throw new RuntimeException(ex);

            }

        }).map(String::trim)

          .map(Float::parseFloat)

          .collect(Collectors.toList());


        int result = Result.priceCheck(products, productPrices, productSold, soldPrice);


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

        bufferedWriter.newLine();


        bufferedReader.close();

        bufferedWriter.close();

    }

}


Comments

Post a Comment

Popular posts from this blog

Two Sum II - Input Array Is Sorted

 Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order , find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2. The tests are generated such that there is exactly one solution. You may not use the same element twice. Your solution must use only constant extra space .   Example 1: Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Explanation: The sum of 2 and 7 is 9. Therefore, index1 = 1, index2 = 2. We return [1, 2]. Example 2: Input: numbers = [2,3,4], target = 6 Output: [1,3] Explanation: The sum of 2 and 4 is 6. Therefore index1 = 1, index2 = 3. We return [1, 3]. Example 3: Input: numbers = [-1,0], target = -1 Output: [1,2] Explanation: The sum of -1 and 0 is -1. Therefore index1 = 1,...
Read more

Comparable Vs. Comparator in Java

  In Java , Comparable and Comparator both are interfaces used to sort objects. Comparable It defines  natural ordering  within a class. It is implemented  inside  the class being sorted. It uses the compareTo() method. It allows sorting  by one one . Comparable provides a  single sorting sequence . In other words, we can sort the collection on the basis of a single element such as id, name, and price. Comparable  affects the original class , i.e., the actual class is modified. Comparable is present in  java.lang  package. We can sort the list elements of Comparable type by  Collections.sort(List)  method. Only one compareTo() method can be implemented, restricting flexibility. Comparator It defines  custom sorting logic It is implemented  in a separate class  or using lambda expressions . It uses the compare() method. It allows sorting  by multiple criteria . The Comparator provides  multiple sorting...
Read more

Increasing Triplet Subsequence

 Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.   Example 1: Input: nums = [1,2,3,4,5] Output: true Explanation: Any triplet where i < j < k is valid. Example 2: Input: nums = [5,4,3,2,1] Output: false Explanation: No triplet exists. Example 3: Input: nums = [2,1,5,0,4,6] Output: true Explanation: The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6. Brute Force : Failed for some testcase class Solution {     public boolean increasingTriplet ( int [] nums ) {         int n = nums . length ;         int i = 0 ;         int j =i+ 1 ;         int k =j+ 1 ;         while (i <n && j<n && k<n)         {         if (nums...
Read more