The first line contains ‘T’, denoting the number of test cases. The first line of each test case contains two integers, ‘N’ and ‘X’, denoting the number of boxes and the target, respectively. The second line of each test case contains an array ‘choco’ of ‘N’ space separated integers, denoting the number of chocolates in each box.
For each test case, print an array of integers denoting the number of chocolates in the boxes that Alex will pick.
You are not required to print the expected output. It has already been taken care of. Just implement the function.
1 <= T <= 5 1 <= N <= 10^5 1 <= X <= 10^9 1<= choco[i] <= 10^4 Where ‘T’ is the number of test cases, ‘N’ is the number of boxes, ‘X’ is the target, and ‘choco[i]’ is the number of chocolates in the box ‘i’, where 0 <= i <= N - 1. Time Limit: 1 sec
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End
Sort 0s, 1s, 2s