Hackathon Safest Performer Selection
Hackathon Safest Performer Selection
A Mumbai hackathon has 3 rounds of judging. Given each team's scores across rounds, find the team with the highest minimum score (most consistent performer who won't crash). Rule: return the 0-based index of the team with the highest MINIMUM round score (earliest index wins ties). Your solve(...) function receives the inputs as ready-made arguments — no input reading or parsing needed; just return the answer.
Approach
Given a 2D array where each row is a team and each column is a round score, find the team index that maximizes the minimum score across all rounds.
Input
Output
More Arrays problems
Browse all coding problems →Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards