coding
-
For each element in a list, Find count of divisors present in the list.
Given a list of integers, find count of divisors present in the list. The number is divisor of itself. The list may contain duplicates. This solution solves the problem in n(log(n)) as compared to straight n^2.