| # | Title | Solutions | Video | Difficulty | Tag

|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------

| 2248|[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2248.java)|| Easy||

| 2244|[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)|| Medium||

| 2243|[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)|| Easy||

| 2220|[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2220.java)|| Easy||

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.Arrays;

importjava.util.List;

importjava.util.Set;

importjava.util.stream.Collectors;

publicclass_2248 {

publicstaticclassSolution1 {

publicList<Integer>intersection(int[][]nums) {

int[]inter =nums[0];

for (inti =0;i <nums.length;i++) {

inter =intersection(nums[i],inter);

}

Arrays.sort(inter);

List<Integer>list =newArrayList<>();

for (inti =0;i <inter.length;i++) {

list.add(inter[i]);

}

returnlist;

}

publicint[]intersection(int[]nums1,int[]nums2) {

Set<Integer>set1 =Arrays.stream(nums1).boxed().collect(Collectors.toSet());

Set<Integer>set2 =Arrays.stream(nums2).boxed().collect(Collectors.toSet());

set1.retainAll(set2);

int[]intersection =newint[set1.size()];

inti =0;

for (intnum :set1) {

intersection[i++] =num;

}

returnintersection;

}

}

}