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.
defclimbingLeaderboard(ranked,player):# Write your code hereranked_new=list(dict.fromkeys(ranked))result=[]N=len(ranked_new)rank=N+1ind=N-1forpinplayer:whileind>=0:ifp>=ranked_new[ind]:rank=ind+1ind-=1else:breakresult.append(rank)returnresult
Cookie support is required to access HackerRank
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 →
Python solution O(n+m)