Simple and Easily Understandable with 0(1) Space Complexity 
IntuitionWith ASCII ValuesApproachComplexity
Time complexity:O(n)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
With ASCII Values

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->


# Code
```java []
class Solution {
    public int reverseDegree(String s) {
        int n = s.length();
        int sum = 0;
        for (int i = 0; i < n; i++) {
            char ch = s.charAt(i);
            int ascii = ch;
            sum+= (123-ch)*(i+1);
        }
        return sum;
    }
}
```
['Math', 'String', 'Java']