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.
Leetcode is a good platform but LC alone can't do much. Cover your basics. I have compiled a list of study material I used to prepare for my coding interviews.
Job hunting tricks to find jobs which better fit your skills and experience. Fed up with repeative jobs? These job search tricks helped me getting more job interviews.
