Python (Simple Prefix Sum)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def bestRotation(self, nums):\n        n = len(nums)\n\n        ans = [1]*n\n\n        for i in range(n):\n            ans[(i-nums[i]+1)%n] -= 1 \n\n        for i in range(1,n):\n            ans[i] += ans[i-1]\n\n        return ans.index(max(ans))\n```
['Python3']