REMOVE DUPLICATE LETTERS | LEETCODE 316 | PYTHON STACK SOLUTION

[@sarayarmohammadi3376]

Thank you for the clear explanation! It was very easy to understand the way you explained it.

[@myko_chxn]

Love you channel for the more niche problems. Thank you so much

[@rahil6455]

Great explanation thank you so much. I guess you could remove the set all together and just search through the string builder, but that would only be if you value memory more than runtime.

[@aliglens]

great video! the space complexity is O(n) though, because its bounded by the string builder array which will have n elements in it.

[@manne4795]

The seen set will ensure that no duplicate elements are added to the string builder array. And there are only 26 possible elements as the input string consists of only lowercase English letters. So the space complexity is O(26)=O(1)

[@YT.Nikolay]

Hi legend, happy New Year! :)

[@crackfaang]

С Новым Годом :)

[@YT.Nikolay]

@@crackfaang с новым годом my man! ;)