Algorithm
Left and Right Sum Differences
Solution
class Solution:
def leftRightDifference(self, nums: List[int]) -> List[int]:
n = len(nums)
ans = [0] * n
left_sum = 0
for i in range(n):
ans[i] = left_sum
left_sum += nums[i]
right_sum = 0
for i in range(n - 1, -1, -1):
ans[i] = abs(ans[i] - right_sum)
right_sum += nums[i]
return ansTime Complexity
O(n)
Space Complexity
O(1)
