How should I practice Find Top Two Teams?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Uber online assessment problems in FastPrep.

Is Find Top Two Teams associated with Uber?

FastPrep tags this as a Uber coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Array

Find Top Two Teams

● EasyUberFULLTIMEOA

See Uber hiring insights

Given 4 arrays wins, draws, scored, conceded of size N these arrays represent the stats of N teams. The array wins[i] represents the number of wins of the i'th team, draws[i] represents the number of draws of the i'th team, scored[i] represents the score of the i'th team, and conceded[i] represents the concede of the i'th team.

For every win, a team is rewarded 3 points and for every draw, a team is rewarded 1 point. The task is to find the highest and second-highest scoring teams. If there is a tie between the points, it will be resolved by taking the difference between scored[i] - conceded[i].

Return the indexes of the teams.

Function Description

Complete the function findTopTwoTeams in the editor.

findTopTwoTeams has the following parameters:

int[] wins: an array of integers representing the number of wins
int[] draws: an array of integers representing the number of draws
int[] scored: an array of integers representing the scores
int[] conceded: an array of integers representing the conceded scores

Returns

int[]: an array of two integers representing the indexes of the top two teams

Hello! Uber assessment comes with 4 coding questions. Here are the other 3 in the same batch 🥝 -

Examples

01 · Example 1

wins = [1, 2, 3]
draws = [1, 1, 1]
scored = [10, 20, 30]
conceded = [12, 23, 12]
return = [2, 1]

points for team 0 = 13 + 11 = 4 points for team 1 = 23 + 11 = 7 points for team 2 = 33 + 11 = 10 return {2,1} PPS: if there is a tie between teams points it will be resolved by taking the difference bewteen scored[i] - conceded[i]