2023-01-23 update: added "2540. Minimum Common Value"

Author: fartem

README.md

@@ -443,6 +443,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2525. Categorize Box According to Criteria                               | [Link](https://leetcode.com/problems/categorize-box-according-to-criteria/)                                 | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/CategorizeBoxAccordingToCriteria.java)                             |
 | 2529. Maximum Count of Positive Integer and Negative Integer             | [Link](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/)               | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MaximumCountOfPositiveIntegerAndNegativeInteger.java)              |
 | 2535. Difference Between Element Sum and Digit Sum of an Array           | [Link](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/description/) | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/DifferenceBetweenElementSumAndDigitSumOfAnArray.java)              |
+| 2540. Minimum Common Value                                               | [Link](https://leetcode.com/problems/minimum-common-value/)                                                 | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MinimumCommonValue.java)                                           |
 
 ### Medium
 

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MinimumCommonValue.java

@@ -0,0 +1,31 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+// https://leetcode.com/problems/minimum-common-value/
+public class MinimumCommonValue {
+
+    private final int[] nums1;
+    private final int[] nums2;
+
+    public MinimumCommonValue(int[] nums1, int[] nums2) {
+        this.nums1 = nums1;
+        this.nums2 = nums2;
+    }
+
+    public int solution() {
+        int lastMin = 0;
+        for (int num : nums1) {
+            for (int i = lastMin; i < nums2.length; i++) {
+                int curr = nums2[i];
+                if (curr == num) {
+                    return num;
+                }
+                if (curr > num) {
+                    lastMin = i;
+                    break;
+                }
+            }
+        }
+        return -1;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/easy/MinimumCommonValueTest.java

@@ -0,0 +1,27 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class MinimumCommonValueTest {
+
+    @Test
+    public void defaultTests() {
+        assertEquals(
+                2,
+                new MinimumCommonValue(
+                        new int[]{1, 2, 3},
+                        new int[]{2, 4}
+                ).solution()
+        );
+        assertEquals(
+                2,
+                new MinimumCommonValue(
+                        new int[]{1, 2, 3, 6},
+                        new int[]{2, 3, 4, 5}
+                ).solution()
+        );
+    }
+
+}