• 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

Calculate price of parking from parking start end time prices

Leetcode: Merge Intervals

SAP Off Campus Hiring_ March 2015 Sample Questions

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

LeetCode: Container With Most Water

Generate largest number arranging a no. of given non negative integer numbers

Reverse a Linked List in groups of given size

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Daughter’s Age VeryGood Puzzle

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Find Nearest Minimum number in left side in O(n)

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Introduction To Number Theory ( Part 1 )

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Find two non repeating elements in an array of repeating elements

ADOBE Aptitude C Language Test

CodeChef’ RRCOPY

flattens 2 D linked list to a single sorted link list

Convert number to words java

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

Subset Sum Problem Dynamic programming

Python Dictionaries

Templates in C++

Leetcode: Edit Distance

Reliance Jio Software Developer Interview Experience

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Right view of Binary tree

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

How Radix sort works

Maximum sum contiguous subarray of an Array

Copyright © 2025 · Genesis Framework · WordPress · Log in