Razorpay HackerEarth OA Experience 2025 (2 Coding Problems)

Problem 1 - Subarray Sum Threshold Problem Statement You are given an integer array nums, an integer k, and an integer threshold. Determine whether there exists at least one contiguous subarray of size exactly k whose sum is strictly greater than threshold. Return true if such a subarray exists, otherwise return false. Constraints Constraint Value Array Length 1 <= nums.length <= 100000 Subarray Size 1 <= k <= nums.length Array Values 1 <= nums[i] <= 100000 Threshold 1 <= threshold ...