Product of the Last K Numbers
Posted: 11 Mar, 2021
Given a sequence of queries of insertion and getProduct, you need to create an array using queries of type-0 and answer queries of type-1.
In each query, the input is of two types :
0 X: insert element ‘X’ at the end array.
1 K: find the product of the last 'K' elements in the array
For the query of type 1, you can assume that the array has at least k values. And at any time, the product of any contiguous sequence of numbers will fit into a single 32-bit integer without overflowing.
The first line of the input contains ‘T’ denoting the number of test cases. The first line of each test case contains ‘Q’ denoting the number of queries. In the next Q lines input is either of the types : 0 X: insert element ‘X’ at the end array. 1 K: find the product of the last 'K' elements in the array.
For each test case, print a single line containing space-separated integers denoting answers of queries of type - 1. The output of each test case will be printed in a separate line.
You do not need to print anything; it has already been taken care of. Just implement the given function.
1 <= T <= 3 0 <= X <= 100 0 <= QUERIES <=5000 1 <= K <= 5000 Where X denotes the value to be stored in the array. Time limit: 1 sec.
Game of 3
Posted: 11 Jul, 2021
Lexicographic Permutation Rank
Posted: 13 Jul, 2021
Zero Pair Sum
Posted: 22 Jul, 2021
Implement a Queue
Posted: 27 Jul, 2021
Remove K Corner Elements
Posted: 31 Jul, 2021