12345678910111213141516171819202122232425262728293031323334353637383940414243444546

class Solution {
    // Function to find a subarray whose sum equals k using sliding window
    public int[] subarrayWithSum(int[] arr, int k) {
        int n = arr.length;
        int left = 0, sum = 0;

        // Traverse array with right pointer
        for (int right = 0; right < n; right++) {
            // Add current element to sum
            sum += arr[right];

            // Shrink window from left while sum > k
            while (sum > k && left <= right) {
                sum -= arr[left];
                left++;
            }

            // Check if sum equals k
            if (sum == k) {
                // Return subarray from left to right
                return java.util.Arrays.copyOfRange(arr, left, right + 1);
            }
        }

        // Return empty array if no subarray found
        return new int[0];
    }
}

public class Main {
    public static void main(String[] args) {
        int[] arr = {1, 7, 3, 9};
        int k = 10;

        Solution sol = new Solution();
        int[] result = sol.subarrayWithSum(arr, k);

        if (result.length > 0) {
            for (int val : result) System.out.print(val + " ");
            System.out.println();
        } else {
            System.out.println("No subarray found");
        }
    }
}

12345678910111213141516171819202122232425262728293031323334353637

class Solution:
    # Function to find a subarray whose sum equals k using sliding window
    def subarrayWithSum(self, arr, k):
        n = len(arr)
        left = 0
        total = 0

        # Traverse array with right pointer
        for right in range(n):
            # Add current element to sum
            total += arr[right]

            # Shrink window from left while sum > k
            while total > k and left <= right:
                total -= arr[left]
                left += 1

            # Check if sum equals k
            if total == k:
                # Return subarray from left to right
                return arr[left:right + 1]

        # Return empty list if no subarray found
        return []

if __name__ == "__main__":
    arr = [1, 7, 3, 9]
    k = 10

    sol = Solution()
    result = sol.subarrayWithSum(arr, k)

    if result:
        print(*result)
    else:
        print("No subarray found")

123456789101112