Answer: DANFOSS Hiring | On-Campus OA (2025) | Find Subarrays With Equal Sum

Approach Traverse the array and calculate the sum of every consecutive pair. Store each sum in a HashSet. If a sum already exists in the set, two different subarrays have the same sum. Return true; otherwise return false. Strategy Use a HashSet to store pair sums. Compute the sum of every subarray of length 2. Check whether the sum has already been seen. If yes, return true; otherwise add it to the set. If no duplicate sum is found, return ...