What is the time and space complexity?

#1

what is it for the problem removing duplicates in a string using recursion

#2

@namangarg31 as you only iterate on the string once its about o(n) - time complexity and space complexity is o(n) is using another array else o(1) as no extra space used
i hope its clear if yes dont forget to mark resolved and hit like :smiley:

#3

Even if i am not using any extra array how the space complexity could be o(1) if i am doing recursion , it should be o(n) due to call stacks.

#4

@namangarg31 yes you are right in recursion the stack will be filled with all the calls so space also o(n)