Showing:
Handle Score
@Ibrahim Nash 6454
@mb1973 5710
@Quandray 5245
@akhayrutdinov 5111
@saiujwal13083 5046
@sanjay05 3762
@kirtidee18 3709
@mantu_singh 3556
@marius_valentin_dragoi 3523
@sushant_a 3459
Longest Subarray with atmost K Even elements
Easy Accuracy: 34.47% Submissions: 810 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 maximum number of chocolates you can collect

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