Company: Autodesk_10april
Difficulty: medium
Race Elimination Problem Description All the competitors in a stock car race have completed their qualifying laps. Each lap, the driver with the current slowest "best" time is eliminated (that is, the highest personal best time). If multiple drivers tie for the slowest time, they are all are eliminated. You are given a two-dimensional string array with each driver's name and lap time in seconds for each lap. Your task is to return the drivers in the order in which they were eliminated, ending with the last driver or drivers remaining. When multiple drivers are eliminated on the same lap, their names should be listed alphabetically. Note: You are not expected to provide the most optimal solution, but a solution with time complexity not worse than O(laps.length * laps[0].length) will fit within the execution time limit. Examples Example 1: Input: laps = [["Harold 114", "Gina 155", "Juan 160"], ["Juan 157", "Gina 158", "Harold 160"], ["Harold 148", "Gina 150", "Juan 151"]] Output: ["Juan"