@@ -0,0 +1,752 @@
+package com.fishercoder.solutions;%0A%0Aimport java.util.List;%0A%0A/**%0A * 1213. Intersection of Three Sorted Arrays%0A *%0A * Given three integer arrays arr1, arr2 and arr3 sorted in strictly increasing order,%0A * return a sorted array of only the integers that appeared in all three arrays.%0A *%0A * Example 1:%0A * Input: arr1 = %5B1,2,3,4,5%5D, arr2 = %5B1,2,5,7,9%5D, arr3 = %5B1,3,4,5,8%5D%0A * Output: %5B1,5%5D%0A * Explanation: Only 1 and 5 appeared in the three arrays.%0A *%0A * Constraints:%0A *%0A * 1 %3C= arr1.length, arr2.length, arr3.length %3C= 1000%0A * 1 %3C= arr1%5Bi%5D, arr2%5Bi%5D, arr3%5Bi%5D %3C= 2000%0A * */%0Apublic class _1213 %7B%0A    public static class Solution1 %7B%0A        public List%3CInteger%3E arraysIntersection(int%5B%5D arr1, int%5B%5D arr2, int%5B%5D arr3) %7B%0A            return null;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1213c