You are viewing a single comment's thread. Return to all comments →
The Solution for the Problem is
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 HashSet<String> pairs = new HashSet<>(); for(int i = 0 ; i < t; i++){ String str = pair_left[i] + " " + pair_right[i]; String rev = pair_right[i] + " " + pair_left[i]; if(!pairs.contains(rev)){ pairs.add(str); } System.out.println(pairs.size()); } } }
Seems like cookies are disabled on this browser, please enable them to open this website
Java Hashset
You are viewing a single comment's thread. Return to all comments →
The Solution for the Problem is