LeetCode
Question
·
Sep 2021
·
Washington DC
Twitter | Coding Round | Array Game
10 upvotes
4,309 views
6 replies
Question Details
Solution 3 def countMoves(numbers): # Write your code here numbers.sort(reverse=True) if len(numbers)==1: return 0 res=0 for i in range(1,len(numbers)): res+=-(numbers[i]-numbers[i-1]) *i return res
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays