Merge sorted list

#1

I want to know that how can I do this question in O1 space, since we are supposed to take all the inputs first corresponding to each test case and then print the output for each one. my code is-

#2

hi, @nikitaguptanikki2
see when the question says do it in O( 1 ) space , it means apart from the space that u have used to intiliase the i/p of the question, no additional DS should be used
like u use the space for initiliasing the i/p then no more space is used, the manipulations are done such that the already allocated memory is used to solve the problem.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.