# DMV Code Challenge

### **Overview** Develop C# .net core application-Appointment scheduler for the Department of Motor Vehicles (DMV). The application reads in data for customers and randomly assigns a customer to a random teller. Your mission, if you choose to accept, is to create an algorithm that more efficiently assigns customers to tellers.

*Customer*

* 5,000 Total - Available Data: - Id - Service Type - Duration of Appointment *Teller*

- 150 Total - Available Data: - Id - Specialty Type - Multiplier

**Details**

- When a customer's service type matches the specialty type of the assigned teller the multiplier with be multiplied against to customer's duration to reduce the appointment time. - Some customers' service type may not match any teller's specialty type. - Not all tellers will have the same multiplier even within the same specialty type. - How the output is calculated (Needs to output the teller with the longest duration and the total duration).

**Goal**

We want to try to process all customers and have our tellers go home as early as possible. All the tellers will leave together once the last customer has been processed. Therefore, your results will **NOT** be measured according to the total number of time the tellers spend with customers but when the last customer is processed.