add 2605

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -21,6 +21,7 @@
 | 2670 | [Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2670.java)                                       |                                      | Easy                           |
 | 2643 | [Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2643.java)                                       |                                      | Easy                           |
 | 2641 | [Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2641.java)                                       |                                      | Medium                         |Tree, BFS, HashTable
+| 2605 | [Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2605.java)                                       |                                      | Easy                           |
 | 2600 | [K Items With the Maximum Sum](https://leetcode.com/problems/k-items-with-the-maximum-sum/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2600.java)                                       |                                      | Easy                           |
 | 2596 | [Check Knight Tour Configuration](https://leetcode.com/problems/check-knight-tour-configuration/)                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2596.java)                                       | [:tv:](https://youtu.be/OBht8NT_09c) | Medium                         |
 | 2595 | [Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/)                                                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2595.java)                                       |                                      | Easy                           |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2605.java

@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Arrays;
+
+public class _2605 {
+    public static class Solution1 {
+        public int minNumber(int[] nums1, int[] nums2) {
+            for (int i = 0; i < nums1.length; i++) {
+                for (int j = 0; j < nums2.length; j++) {
+                    if (nums1[i] == nums2[j]) {
+                        return nums1[i];
+                    }
+                }
+            }
+            Arrays.sort(nums1);
+            Arrays.sort(nums2);
+            if (nums1[0] < nums2[0]) {
+                return nums1[0] * 10 + nums2[0];
+            } else {
+                return nums2[0] * 10 + nums1[0];
+            }
+        }
+    }
+}