We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Data Structures
  4. Java Hashset
  5. Discussions

Java Hashset

Sort 234 Discussions, By:

  • eduardopalmeida
     + 19 comments

    A simple solution

        HashSet<String> pairs = new HashSet<String>(t);

    for(int i = 0; i < t; i++)
    {
        pairs.add("(" + pair_left[i] + ", " + pair_right[i] + ")" );
        System.out.println(pairs.size());        
    }

  • jwiszowaty
     + 3 comments

    Solution using HashSet with custom objects:

    import java.util.*;

class Pair {
    public String name1;
    public String name2;
    
    Pair(String name1, String name2) {
       this.name1 = name1;
       this.name2 = name2;
    }
    
    @Override
    public boolean equals(Object o) {
        if(this == o) return true;
        if(!(o instanceof Pair)) return false;

        Pair pair = (Pair) o;
        if(name1.equals(pair.name1) &&
           name2.equals(pair.name2)) return true;
        return false;
    }

    @Override
    public int hashCode() {
        int result = name1.hashCode();
        result = 31 * result + name2.hashCode();
        return result;
    }    
}

public class Solution {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Set<Pair> set = new HashSet<Pair>();
        int T = scanner.nextInt();
        
        for(int i = 0; i < T; i++) {
            set.add(new Pair(scanner.next(), scanner.next()));
            System.out.println(set.size());
        }
    }
}

  • Jesu_ZConte
     + 3 comments

    Another solution. 

    Set<List> lista = new HashSet<List>();
        for (int i = 0; i < t; i++){
            lista.add(Arrays.asList(pair_left[i],pair_right[i]));
            System.out.println(lista.size());
        }

  • lahouari
     + 1 comment
    //Write your code here
    s.close();

    Set<String> set = new HashSet<>();
    for (int i = 0; i < t; i++) {
        set.add(pair_left[i] + " " + pair_right[i]);
        System.out.println(set.size());
    }

  • Vriti_Shivang_
     + 0 comments

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

    public class Solution {

    public static void main(String[] args) { Scanner s = new Scanner(System.in); int t = s.nextInt(); String [] pair_left = new String[t]; String [] pair_right = new String[t];

        for (int i = 0; i < t; i++) {
        pair_left[i] = s.next();
        pair_right[i] = s.next();
    }
    s.close();
    Set<String> set = new HashSet<>();
    for (int i = 0; i < t; i++) {
        set.add(pair_left[i] + " " + pair_right[i]);
        System.out.println(set.size());
    }

    } }

Load more conversations