Python 3 || 2 lines,  pairwise || T/S: 99% / 93%
\nclass Solution:\n    def scoreOfString(self, s: str) -> int:\n\n        absdiff = lambda x: abs(ord(x[0]) - ord(x[1]))\n\n        return sum(map(absdiff,pairw
```\nclass Solution:\n    def scoreOfString(self, s: str) -> int:\n\n        absdiff = lambda x: abs(ord(x[0]) - ord(x[1]))\n\n        return sum(map(absdiff,pairwise(s)))\n```\n[https://leetcode.com/problems/score-of-a-string/submissions/1231356748/](https://leetcode.com/problems/score-of-a-string/submissions/1231356748/)\n\nI could be wrong, but I think that time complexity is *O*(*N*) and space complexity is *O*(1), in which *N* ~ `len(s)`.
['Python3']