Given an array consisting of** N** positive integers, and an integer **k **.You have to find the maximum product of k contiguous elements in the array. Your task is to complete the function which takes three arguments .The first argument is the array **A[ ]** and second argument is an integer** N **denoting the size of the array** A[ ]** and the third argument is an integer k.The function will return and value denoting the largest product of sub-array of size k.

**Input:**

The first line of input is an integer T denoting the no of test cases. Then T test casesfollow . The first line of each test case are two integer N and K separated by space .The next line contains N space separated values of the array A[ ].

**Output:**

Output of each test case will be an integer denoting the largest product of subarray of size k.

**Constraints:**

1 <=T<= 100

1 <=N<= 10

1 <=K<= N

1<=A[]<=10

**Example:
Input**

1

4 2

1 2 3 4

12

The sub-array of size 2 will be 3 4 and the product is 12.

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

agness | 122 |

aman1931998 | 102 |

Survivor | 100 |

uchitnitk | 96 |

lonecoder | 95 |

KshatriyaYash | 1066 |

nikhil_sojan | 1032 |

lonecoder | 1030 |

mazumderrohit8 | 899 |

SumitSingh27 | 832 |

blackshadows | 5327 |

Ibrahim Nash | 5215 |

akhayrutdinov | 5111 |

mb1973 | 4492 |

Quandray | 4444 |

Login to report an issue on this page.