100% easy understandable solution ♐✅
\n\n# Code\n\nimport java.util.Arrays;\n\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int max = 0;\n        int result =
\n\n# Code\n```\nimport java.util.Arrays;\n\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int max = 0;\n        int result =Integer.MAX_VALUE ;\n        for (int i = 0; i < divisors.length; i++) {\n            int count = 0;\n            for (int j = 0; j < nums.length; j++) {\n                if (nums[j] % divisors[i] == 0) {\n                    count++;\n                }\n            }\n            if (count > max) {\n                max = count;\n                result = divisors[i];\n            } else if (count == max) {\n                result = Math.min(result, divisors[i]);\n            }\n        }\n        return result;\n    }\n}\n\n```
['Array', 'Java']