using System;

public class Program

{

    public static void Main()

    {

        int[] nums = new int[]{3, 1, 2, 7, 4, 2, 1, 1, 5};

        int target = 8;

​

        string output = MaxLength(nums, target).ToString();

        Console.WriteLine(output);

        int[] nums2 = new int[]{10, 5, 2, 6};

        int target2 = 100;

        string output2 = MaxProduct(nums2, target2).ToString();

        Console.WriteLine(output2);

        int[] nums3 = new int[]{3, -1, 4, 12, -8, 5, 6};

        int target3 = 4;

        string output3 = MaxProduct(nums3, target3).ToString();

        //Console.WriteLine(output3);

    }

    // Time Complexity of O(n)  Linear

    public static int MaxLength(int[] nums, int target)

    {

        int left = 0 ;

        int curr = 0;

        int answer = 0;

        for(int right= 0; right < nums.Length; right++)

        {

            curr += nums[right];

            while (curr > target)

            {

                curr -= nums[left];

                left++;

            }

            answer = Math.Max(answer, right - left + 1);

            if (curr == target)

            {

                break;

            }

        }

        // return the windowLength

        return answer;

    }

    public static int MaxProduct(int[] nums, int limit)

    {

        int left = 0 ;

        int curr = 1;

        int answer = 0;

        for(int right= 0; right < nums.Length; right++)

        {

            curr *= nums[right];

            while (curr >= limit)

            {

                curr /= nums[left];

                left++;

            }

            answer += right - left + 1;

        }

        return answer;

    }

    public static int FixedWindow(int[] nums, int target)

    {

        int curr = 0;

        // build the regular window first. casue it starts at the origin and measures 4 elements

        for (int i = 0; i < target; i++)

        {

            curr += nums[i];

        }

        int answer = 0;

​

        return answer;

    }

}