Longest Subarray with atmost K Even elements
Easy Accuracy: 39.23% Submissions: 1203 Points: 2

Given an array arr of integers of size N and an integer K, the task is to find the length of the longest subarray with at most K even elements

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two space-separated integers N and K.
3. The second line contains
N space-separated positive integers represents array arr.

Output: For each test case, print the length of the longest subarray with at most K even elements.

Constraints:
1. 1 <= T <= 10

2. 1 <= K <= N <= 100000
3. 0 <= arr[i] <= 100000


Example:
Input:

2
4 2
1 2 3 4

4 1
1 2 3 4

Output:
4
3

Explanation:
Test case 1: {1, 2, 3, 4} has 2 even elements
Test case 2: {1, 2, 3} has 1 even elements

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Longest Subarray with atmost K Even elements

Output Window