 ||✅ Easiest Solution ✅ ||
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

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

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

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

# Code
```cpp []
class Solution {
public:
    int reverseDegree(string s) {
        int ans = 0;
        for (int i = 0; i < s.length(); i++) {
            int revIndex = 26 - (s[i] - 'a'); // Get reversed alphabet position
            ans += revIndex * (i + 1); // Multiply with 1-based index
        }
        return ans;
    }
};

```
['C++']