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

Q1: Find Subarrays With Equal Sum Problem Statement Given a 0-indexed integer array nums, determine whether there exist two subarrays of length 2 that have the same sum. The two subarrays must start at different indices. Example Input nums = [4,2,4] Output true Constraints 2 <= nums.length <= 1000