Brute force || beginner friendly
Youtube : The Adarsh 1M\n# Code\n\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int count = 0,real = 0,out = divisors[0];
# Youtube : The Adarsh 1M\n# Code\n```\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int count = 0,real = 0,out = divisors[0];\n        int m = divisors.length , n = nums.length;\n        for(int i = 0; i < m; ++i){\n            count = 0;\n            for(int j = 0; j < n ; ++j){\n                \n                if(nums[j] % divisors[i] == 0)\n                ++count;\n            }\n            if(count == real)\n               out = Math.min(out , divisors[i]);\n            if(count > real){\n                // if(divisors[i] > out)\n                // continue;\n               out = divisors[i];\n               real = count;\n            }\n            \n\n        }\n        return out;\n    }\n}\n```
['Java']