• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Code Chef PRGIFT Solution

August 6, 2014 by Dhaval Dave

Today is chef’s friend’s birthday. He wants to give a gift to his friend. So he was desperately searching for some gift here and there.
Fortunately, he found an array a of size n lying around. The array contains positive integers. Chef’s friend likes even numbers very much. So for the gift, chef will choose a consecutive non-empty segment of the array. The segment should contain exactly k even integers. Though it can have any number of odd integers.

He will then pick that segment and gift it to his friend.
But there is a problem. It might not be always possible for the chef to choose such a segment. Please tell whether it is possible for chef to select some gift or not?
Input

First line of the input contains a single integer T denoting number of test cases.
For each test case, first line contains two space separated integers n, k.
Next line contains n space separated integers denoting content of array a.
It is also guaranteed that all the numbers in the array a are distinct.
Output

For each test case, print a single line containing “YES” or “NO” (without quotes) corresponding to the situation.
Constraints

1 ≤ T ≤ 10
1 ≤ n ≤ 50
0 ≤ k ≤ n
1 ≤ a i ≤ 100
Example

Input:
4
2 1
1 2
3 2
2 6 5
3 3
2 4 5
4 2
1 2 4 5

Output:
YES
YES
NO
YES
Explanation

For first test case, we can select a[2, 2] = {2}.
For second test case, we can select a[1, 2] = {2, 6}.
For third test case, we can not select any consecutive segment having exactly 3 even numbers.
For fourth test case, we can select a[2, 3] = {2, 4}.

Thanks to Dhaval for suggesting this approach and Article

Code :

#include <stdio.h>

#define gc getchar_unlocked
#define pc putchar_unlocked
inline int scan(){register int n=0,c=gc();while(c<‘0’||c>’9’)c=gc();while(c<=’9’&&c>=’0′)n=(n<<1)+(n<<3)+c-‘0’,c=gc();return n;} 

int main(void){
    int i,t,n,k,x,count=0;
t=scan();
    
while(t–){
n=scan();
k=scan();
while(n–){
x=scan();
if(x%2==0) count++;
}//while
if (count >= k) printf(“nYES“);
else printf(“nNO“);
        count=0;
}//while

 return 0;
}

//STDIN Input : 4 2 1 1 2 3 2 2 6 5 3 3 2 4 5 4 2 1 2 4 5

You can find Working code at http://ideone.com/pIhXeL

Similar Articles

Filed Under: Flipkart Interview Questions, Interview Questions, problem Tagged With: Array, codechef

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Add Sub Multiply very large number stored as string

CodeChef Code SGARDEN

Spanning Tree

Find loop in Singly linked list

Introduction To Number Theory ( Part 1 )

Knight Tour Problem (Graph – Breadth First Search)

Diagonal Traversal of Binary Tree

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Coin Collection Dynamic Programming

Test Cases for Round Function

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

SAP Off Campus Hiring_ March 2015 Computer Skills

Find Percentage of Words matching in Two Strings

Find the element that appears once others appears thrice

BFS (Breath First Search)

Handle duplicates in Binary Search Tree

K’th Largest Element in BST when modification to BST is not allowed

Given Set of words or A String find whether chain is possible from these words or not

Check if an array has duplicate numbers in O(n) time and O(1) space

Naurki.com Security Breach

25 horses 5 tracks Find 3 fastest puzzle

Python Array String

Circular Linked List

Practo Hiring Experience

Check Binary Tree is Binary Search Tree or not

Sequence Finder Dynamic Programming

Walmart Labs Interview Experience

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Interfaces in C++ (Abstract Classes in C++)

Connect n ropes with minimum cost

Copyright © 2025 · Genesis Framework · WordPress · Log in