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

  • sonawanesahil360
     + 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();
    }

    // Write your code here
    // solving this problem using HashSet
    HashSet<String> set = new HashSet<>();
    int count = 0;
    for (int i = 0; i < t; i++) {
        set.add(pair_left[i] + " " + pair_right[i]);
        count = set.size();
        System.out.println(count);
    }
}

    }