( long a1[], long a2[], long n, long m)
| 1 | class Compute { |
| 2 | public String isSubset( long a1[], long a2[], long n, long m) { |
| 3 | |
| 4 | HashSet<Long> set = new HashSet<Long>(); |
| 5 | |
| 6 | for(int i=0;i<n;i++) |
| 7 | { |
| 8 | set.add(a1[i]); |
| 9 | } |
| 10 | |
| 11 | for(int j=0;j<m;j++) |
| 12 | { |
| 13 | if(!set.contains(a2[j])) return "No"; |
| 14 | } |
| 15 | return "Yes"; |
| 16 | } |
| 17 | } |