3 Questions 90 min\n\nQ1. Sort names with Roman Numerals\nQ2. Efficient Janitor\nQ3. Optimal Office Placement \n\nQ1 and Q2 have been discussed on the forum before so I\'ll leave those out. \nQ3.  Given a matrix that describes the distance from the offices. \'0\' being offices and other integers being vertical + horizontal distance, find the maximum distance of a \'lot\' in the graph. \n\nGiven: Number of offices n, width x, hieght h.\n\nCould not come up with a solution. Later on found a link to the problem [https://stackoverflow.com/questions/52562585/maximal-value-among-shortest-distances-in-a-matrix] \n\nWhat is the 2 interview threshold this year? Does anyone know?\n

3 Questions 90 min\n\nQ1. Sort names with Roman Numerals\nQ2. Efficient Janitor\nQ3. Optimal Office Placement \n\nQ1 and Q2 have been discussed on the forum bef