2480. Find Subarrays With Equal Sum
My accepted Python solution to LeetCode problem 2480, Find Subarrays With Equal Sum, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- 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 0ms, memory 17.4MB, accepted 2025-12-31.
class Solution:
def findSubarrays(self, nums: List[int]) -> bool:
seen = set()
for i in range(len(nums) - 1):
s = nums[i] + nums[i + 1]
if s in seen:
return True
seen.add(s)
return False