Google Phone Screen Feb 2020\nInterviewing with 2.5 yrs exp probably for L4\n\nImplement a function such that given a list of integers and list of frequencies, returns true if the number of duplicate integers maps to some frequency. Eg.\n\n[1, 2, 3, 4] and [2] --> false -- because there is not 2 of anything\n[1, 1, 2, 3] and [2] --> true -- because there are 2 1s\n[1, 1, 2, 3] and [2, 2] --> false -- because there are 2 1s, but not 2 of anything else\n[1, 2, 3, 4] and [1] --> true -- because there is 1 1, or 1 2, etc.\n[1, 1, 1, 1, 1] and [2, 2] --> true -- because we can satisfy frequency count w number of duplicate 1s\n\n```\nboolean hasRepeats(List<Integer> numbers, List<Integer> repeats)\n```\n\nTook forever to solve it, and didn\'t even really by the end.. think this was a warm up. Definitely my bad for not leetcoding hard enough. Kicking myself..\nMy soln - \n- Iterate over numbers and get num duplicates by hashtable\n- sort both lists (num duplicates and repeats)\n- for every repeat\n\t- get greatest num duplicate (first item in the list)\n\t- if repeat greater than num duplicates, return false we\'re done, nothing can satisfy\n\t- else subtract repeat from num duplicates, reinsert that value into list, advance num duplicate pointer\n\nthings I missed (among others): don\'t reinsert if value is 0, remove num duplicate list item so list doesn\'t become very long

Google Phone Screen Feb 2020\nInterviewing with 2.5 yrs exp probably for L4\n\nImplement a function such that given a list of integers and list of frequencies, 