Find Top Two Teams

capitalone

Find the Top Two Teams

There are n teams numbered from 0 to n - 1. You are given four integer arrays of equal length n:

  • wins[i]: number of wins for team i;
  • draws[i]: number of d...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: