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.
- Prepare
- Java
- Data Structures
- Java Hashset
- Discussions
Java Hashset
Java Hashset
Sort by
recency
|
368 Discussions
|
Please Login in order to post a comment
This passes all cases barr 5. Seems to be an issue with test case 5 as others have pointed out.
The problem statement clearly says "That also implies (a, b) is not same as (b, a)", but following that causes test case 5 to fail. To "fix" my solution, I had to treat (a, b) and (b, a) as identical. Please update the problem to reflect this.
Is it possible to get confirmation that test 5 contains a bug/ faulty test data? i spent ages looking through it but i cannot figure out whats wrong. Some people seem to have found solutions to pass all tests though
I think the test case 5 is wrong. Does anybody have the same opinion? I am totally confused...
Yes, I didn't get that testcase either.
Passed Test
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];
} }
I don't know why you want to sort, nowhere it said to sort. it just asked to print the unique pair count which you get just by doing .size() on set.
Unix comming to the rescue:
That means 990 uniq entries (the first line is the 1000 number.). So, the test 5 is wrong.
The test 5 answer that hacker rank has says 975 unique entires. So that is wrong.