K Consecutive Odd Elements
Easy Accuracy: 51.47% Submissions: 402 Points: 2

Given an array arr of integers of size N and an integer K, the task is to check if there exit K consecutive odd numbers or not if the elements are arranged in non-decreasing order.

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, If exits print print "yes". Otherwise "no" (without quotes)

Constraints:
1. 1 <= T <= 10

2. 1 <= K <= N <= 100000
3. 1 <= arr[i] <= 10^9


Example:
Input:

3
4 2
4 1 3

7 3
2 5 1 5 3 7 8
5 2

5 4 3 2 1

Output:
yes
yes
no

Explanation:
Test case 1: Elements in non-decreasing order will be {1, 3, 4}. And there exit 2 consecutive odd numbers.
Test case 2: Elements in non-decreasing order will be {1, 2, 3, 5, 5, 7, 8}. And there exit 3 consecutive odd numbers.
Test case 3: Elements in non-decreasing order will be {1, 2, 3, 4, 5}. And there does not exit 2 consecutive odd numbers.

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.

K Consecutive Odd Elements

Output Window