93.13 % beats in runtime only one liner !!!
\n# Code\n\nclass Solution:\n    def sumDistance(self, nums: List[int], s: str, d: int) -> int:\n        nums = sorted([num + (ord(ch) - 79) // 3 * d for num, c
\n# Code\n```\nclass Solution:\n    def sumDistance(self, nums: List[int], s: str, d: int) -> int:\n        nums = sorted([num + (ord(ch) - 79) // 3 * d for num, ch in zip(nums, s)]);return sum(map(mul, nums, range(1 - len(nums), len(nums), 2))) % 1000000007\n```
['Breadth-First Search', 'Probability and Statistics', 'Minimum Spanning Tree', 'Biconnected Component', 'Strongly Connected Component', 'Python3']