Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6379 |

@blackshadows | 6329 |

@mb1973 | 5358 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@ritiksethi21 | 1050 |

@aroranayan999 | 807 |

@RizulBansal | 685 |

@ashishtrehan002 | 538 |

@hemantgarg923 | 528 |

@simrangoyal | 526 |

@ronaldo77 | 520 |

@thanosagain | 505 |

@anishrajan | 505 |

@ssparteek470 | 495 |

@rahul2312 | 491 |

Complete Leaderboard |

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.

Login to report an issue on this page.

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

Yes
K Consecutive Odd Elements

...