Simple Java solution faster than 100%
Just do simple calculation and count which is maximum.\n# If you like please upvote it.\n\n# Code\n\nclass Solution {\n    public int maxDivScore(int[] nums, in
# **Just do simple calculation and count which is maximum.**\n# If you like please upvote it.\n\n# Code\n```\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int n = nums.length;\n        int m = divisors.length;\n        int min = Integer.MAX_VALUE;\n        int max = Integer.MIN_VALUE;\n        int[] d = new int[m];\n        for(int i=0;i<m;i++)\n        {\n            int count = 0;\n            for(int j=0;j<n;j++)\n            {\n                if(nums[j]%divisors[i]==0)\n                {\n                    count++;\n                }\n            }\n            d[i] = count;\n        }\n        for(int i=0;i<m;i++)\n        {\n            if(d[i]>=max)\n            {\n                max = d[i];\n            }\n        }\n        for(int i=0;i<m;i++)\n        {\n            if(d[i]==max)\n                 min = Math.min(min,divisors[i]);\n        }\n        return min;\n    }\n}\n```
['Array', 'Java']