algorithms

Commit Graph

Author	SHA1	Message	Date
Vasily Guzov	aeb641e339	[6kyu][fundamentals][strings][array] https://www.codewars.com/kata/54b42f9314d9229fd6000d9c/solutions/typescript The goal of this exercise is to convert a string to a new string where each character in the new string is "(" if that character appears only once in the original string, or ")" if that character appears more than once in the original string. Ignore capitalization when determining if a character is a duplicate.	1 year ago

Author

SHA1

Message

Date

Vasily Guzov

aeb641e339

[6kyu][fundamentals][strings][array]

https://www.codewars.com/kata/54b42f9314d9229fd6000d9c/solutions/typescript

The goal of this exercise is to convert a string to a new string where
each character in the new string is "(" if that character appears only
once in the original string, or ")" if that character appears more than
once in the original string. Ignore capitalization when determining if a
character is a duplicate.

1 Commits (f5ec24bc373d6a8570952ec7e133743b87e9291a)