


The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case will contain one integer, ‘X’ that denotes the number of terms he has to answer.
For each test case, return a vector with the first ‘X’ integer of the series 3 * ‘N’ + 2, which is not multiple of 4.
Output for every test case will be printed in a separate line.
You don’t need to print anything; It has already been taken care of.
1 <= T <= 10^2
1 <= X <= 10^5
Time Limit: 1 sec
The basic idea of this approach is to iterate through all the elements obtained in series 3 * ‘N’ + 2. We will see if the number is divisible by 4 or not. If it is acceptable, then we will store it in our final answer array/list. We will run the process until we don’t get the first ‘X’ number of elements.
Here is the algorithm:
Split Array Into K Subarrays
Bob’s Robot
Transpose of a Matrix
Number of Digits
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series
Print Fibonacci Series