Implement k-Vendor problem

• Create a function that takes in an array of strings and an integer k

• Return the kth most frequent string in the array

• Use a hashmap to store the frequency of each string