LeetCode 2540: Minimum Common Value Solution

Master LeetCode problem 2540 (Minimum Common Value), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2540. Minimum Common Value

Easy

Array Hash Table Two Pointers Binary Search

Problem Explanation

Explanation

To find the minimum common value between two sorted arrays, we can use a two-pointer approach. We will iterate through both arrays simultaneously using two pointers, incrementing the pointer for the smaller value at each step. If we find a common value, we update the minimum common value found so far. This approach ensures that we find the minimum common value as we are iterating over sorted arrays.

Start with two pointers at the beginning of both arrays.
Move the pointer of the smaller value to the next element.
If the values pointed to are equal, update the minimum common value found.
Repeat until the end of either array is reached.

Time complexity: O(m + n) where m and n are the lengths of the input arrays nums1 and nums2 respectively. Space complexity: O(1)

Solution Code

class Solution {
    public int findMinimumCommonValue(int[] nums1, int[] nums2) {
        int i = 0, j = 0;
        int minCommon = Integer.MAX_VALUE;

        while (i < nums1.length && j < nums2.length) {
            if (nums1[i] == nums2[j]) {
                minCommon = Math.min(minCommon, nums1[i]);
                i++;
                j++;
            } else if (nums1[i] < nums2[j]) {
                i++;
            } else {
                j++;
            }
        }

        return minCommon == Integer.MAX_VALUE ? -1 : minCommon;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2540 (Minimum Common Value)?

This page provides optimized solutions for LeetCode problem 2540 (Minimum Common Value) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2540 (Minimum Common Value)?

The time complexity for LeetCode 2540 (Minimum Common Value) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2540 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2540 in Java, C++, or Python.

Back to LeetCode Solutions