Even-after-odd question about space complexity

#1

is this question can be implemented in O(1) space complexity ?

#2

Hey if you are talking about this linked list question, then yes you can do it in Auxiliary space O(1) as you can convert the list to the desired even-after-odd linked list in place . The time complexity however would be O(n).
Remember in case of linked list we consider the in place manipulation of the list takes constant space and we dont consider the space taken by linked list.

#3

Hey archit
I am marking your doubt as resolved. You can open it again if you feel so

#4

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.