Skip to main content

Java Hashset HackerRank Solution | Programming Blog

Java Hashset HackerRank Solution with Explanation

 

Java Hashset HackerRank Solution

Problem Statement :-

In computer science, a set is an abstract data type that can store certain values, without any particular order, and no repeated values. {1,2,3} is an example of a set, but {1,2,2} is not a set. Today you will learn how to use sets in java by solving this problem.

You are given n pairs of strings. Two pairs (a,b) and (c,d) are identical if a = c and b = d. That also implies (a,b) is not same as (b,a). After taking each pair as input, you need to print number of unique pairs you currently have.

See full problem description in HackerRank Website :-

https://www.hackerrank.com/challenges/java-hashset/problem

Let's see solution of problem.

import java.util.HashSet;
import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println("Enter total pair");
        int t = s.nextInt();
        String [] pair_left = new String[t];
        String [] pair_right = new String[t];
        
        System.out.println("Enter string pair");
        for (int i = 0; i < t; i++) {
            pair_left[i] = s.next();
            pair_right[i] = s.next();
        }
        
        HashSet<String> set = new HashSet<>();
        
        for (int i = 0; i < t; i++) {
            set.add(pair_left[i] + " , " + pair_right[i]);
            System.out.println(set.size());
        }

    }

}

Input :-

    5
    john tom
    john mary
    john tom
    mary anna
    mary anna 

Output :-

    1
    2
    2
    3
    3

Explanation :-

  1. Declare new HashSet.
  2. Loop through given total number of pairs.
  3. Add pair into set, separated by comma. (We can take any separator).
  4. Check size of set. If Given pair is matched in set then set does not store that pair into it and HashSet size remains same.

We must add some separator in to above solution, because if there is given pair like "abc def" and after there is another pair like "ab cdef" then without separator it HashSet count same value "abcdef" and we got wrong output.

If we include any separator then, 

pair 1 : "abc def" = abc,def
pair 2 : "ab cdef" = ab,cdef

Both pair count differently and we got correct output.

If you have any query regarding above solution comment down. I am happy to resolve it.

Happy Coding.

Other Hacker Rank Solutions :-



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