Problem Description
Given three integer arrays nums1, nums2, and nums3, return a distinct array containing all the values that are present in at least two out of the three arrays. You may return the values in any order.
Key Insights
- We need to identify elements that appear in at least two of the three arrays.
- Using a hash table (or dictionary) can help count occurrences of each number across the arrays.
- The final result should contain distinct values only.
Space and Time Complexity
Time Complexity: O(n), where n is the total number of elements across the three arrays.
Space Complexity: O(n), for storing the counts of each number.
Solution
To solve this problem, we can use a hash table (or dictionary) to keep track of the count of each number across the three input arrays. We will iterate through each array and increment the count for each number found. After processing all arrays, we will collect numbers that have a count of 2 or more into a result list. Finally, we will return this list, ensuring all values are distinct.