Google-Developer-Student-Club-CCOEW / Competitive-Coding

7 stars 52 forks source link

Question 60 #109

Closed komalvhanmane closed 1 year ago

komalvhanmane commented 1 year ago

You are given an integer array nums and two integers minK and maxK.

A fixed-bound subarray of nums is a subarray that satisfies the following conditions:

The minimum value in the subarray is equal to minK. The maximum value in the subarray is equal to maxK. Return the number of fixed-bound subarrays.

A subarray is a contiguous part of an array.

Example 1:

Input: nums = [1,3,5,2,7,5], minK = 1, maxK = 5 Output: 2 Explanation: The fixed-bound subarrays are [1,3,5] and [1,3,5,2].

siddhesh-coder commented 1 year ago

mam assign me this problem

komalvhanmane commented 1 year ago

@siddhesh-coder mention college , name , branch , year .

siddhesh-coder commented 1 year ago

college: Dr.D.Y.Patil Institute of Engineering & Technology Ambi name: Siddhesh Bhosale Branch: computer Engineering year: BE Final Year

komalvhanmane commented 1 year ago

@siddhesh-coder I have assigned you this issue . work on it :)

siddhesh-coder commented 1 year ago

yes

aditi3004 commented 1 year ago

HEY!! Name: Aditi Sharma College: MKSSS's Cummins College of Engineering for Women Dept: Computer Science I would like to work on this issue can you please assign it to me?