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

  • gurjit1030
     + 0 comments

    Python, O(n+m)

    def climbingLeaderboard(ranked, player):
    ranks = []
    ranked = sorted(list(set(ranked)))
    currRank = len(ranked)+1
    for i in player:
        while ranked and i >= ranked[0]:
            del ranked [0]
            currRank -= 1
        ranks.append(currRank)
    return ranks

    First the list is converted to a set and then back to a list to remove all dupes. Then loops through each element of players, deprecating the ranking and deleting every value of ranked smaller than the player value. The while loop is only ever entered len(ranked) times.