We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Climbing the Leaderboard
  5. Discussions

Climbing the Leaderboard

  • inq_daniel_eliz1
     + 0 comments

    I aimed to make the code traverse both lists only once, and this was the result. Any suggestions for improvement?

    def climbingLeaderboard(ranked, player):
    ranked = sorted(set(ranked), reverse=True)
    player = sorted(player, reverse=True)
    player_ranks = []
    
    i = 0
    
    for p in player:
        while i <= len(ranked):
            if i == len(ranked):
                player_ranks.append(i + 1)
                break
            elif p >= ranked[i]:
                player_ranks.append(i + 1)
                break
            i += 1

    return sorted(player_ranks, reverse=True)