Java Intermediate Solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int maxDivScore(int[] nums, int[] divisors) {
        HashMap<Integer, Integer> map = new HashMap();
        int ans = Integer.MAX_VALUE;
        int max = 0;
        for(int i = 0; i<divisors.length; i++){
            int count = 0;
            for(int j = 0; j<nums.length; j++){
                if(nums[j] % divisors[i] == 0){
                    map.put(divisors[i], ++count);
                }
            }
        }
        if(map.isEmpty()){
            for(int num : divisors){
                if(num < ans){
                    ans = num;
                }
            }
            return ans;
        }
        for(int key : map.keySet()){
            if(map.get(key) > max){
                max = map.get(key);
            }
        }   
        for(int key : map.keySet()){
            if(map.get(key) == max){
                   if(key < ans)
                    ans = key;
            }
        }   
        return ans;
    }
}
```
['Java']