4058. Compute Alternating Sum
My accepted Python solution to LeetCode problem 4058, Compute Alternating Sum, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.5MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.5MB, accepted 2025-12-30.
class Solution:
def alternatingSum(self, nums: List[int]) -> int:
return sum(nums[i] if i % 2 == 0 else -nums[i] for i in range(len(nums)))