Skip to main content

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 and at last print total pair present in given array of socks. 

Solution 1 : Java Code for Sales By Match Problem

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class SalesbyMatch {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        System.out.println("Enter number of total socks");

        int numberOfSocks = sc.nextInt();
        int[] arrayOfSocks = new int[numberOfSocks];
       
        System.out.println("Enter all socks ");
        for (int i = 0; i < arrayOfSocks.length; i++) {
            arrayOfSocks[i] = sc.nextInt();
        }
       
        Map<Integer, Integer> map = new HashMap<>();
       
        int numberOfMatchingPairs = 0;

        /*
         If map does not contains pair of sock then put into map and
         set value to 1. If map contains then we remove that sock
         means we found 1 pair of socks. Delete that socks and
         increment the value of numberOfMatchingPairs
        */
        for (int i : arrayOfSocks) {
            if (!map.containsKey(i)) {
                map.put(i, 1);
            } else {
                map.remove(i);
                ++numberOfMatchingPairs;
            }
        }
       
        System.out.println(numberOfMatchingPairs);
    }

}

Output :-
Enter number of total socks
9
Enter all socks
10 20 20 10 10 30 50 10 20
3

Explanation :

  • In above solution we are using HashMap data structure. HashMap contains key - value pair. HashMap does not contains any duplicate key but it can contains duplicate value. So we are taking advantage of Map in above code.
  • Traverse through given arrayOfSocks array and check, if map does not contains any socks then we are storing into map with socks as key and 1 as value. If map already contains socks we are removing that sock and increment numberOfMatchingPairs by 1.
  • Last print numberOfMatchingPairs, it will return all matching pair number.

 

Other HackerRank Problem and its solution with Explanation

 

Comments

Post a Comment

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