Can I solve it without using the SET STL?

#1

Can I solve it without using the SET STL?

#2

hello @cbcao263 yes you can definitely solve it without using set .

#3

How Sir?
Can You Please tell.

And Also in Permutations
Are you saying with Hashmaps?

#4

@cbcao263 then the approach is completely different .
if you want to do recursion method according to yours only then you have done in the correct way .
you have to just solve the questions .
dont think this way that you have ti understand all the methods.

#5

Okayy bro,
Actually Yesterday I found a Question at Interview Bit
Where I can’t actually use set
And The Question is to find unique permutations only.

That’s why I asked about that.

#6

hello @cbcao263 if you feel your doubt is cleared please mark this doubt as resolved.
on off the chance if you feel that you still have doubt you can reopen the doubt and we will clear it .
Happy Learning !!

#7

How to mark resolved?
Can You Please send the link where I can give 5* nd all.

#8

@cbcao263 in the question you have raised doubt if you scroll down there you will see the option to mark the doubt as resolved and there only you will see the option of give feedback .

#9

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.