You are viewing a single comment's thread. Return to all comments →
import bisect def climbingLeaderboard(ranked, player): ranked=sorted(list(set(ranked))) player.sort() ladder=[] for p in player: i = bisect.bisect_left(ranked, p) if i >= len(ranked): i = len(ranked) - 1 elif p<ranked[i]: i-=1 ladder.append(len(ranked)-i) return ladder
Seems like cookies are disabled on this browser, please enable them to open this website
Climbing the Leaderboard
You are viewing a single comment's thread. Return to all comments →