-
Notifications
You must be signed in to change notification settings - Fork 0
/
Codewars_8.py
10 lines (10 loc) · 662 Bytes
/
Codewars_8.py
1
2
3
4
5
6
7
8
9
10
#Codewars, leetcode
#Write a function which makes a list of strings representing all of the ways you can balance n pairs of parentheses
#balancedParens 0 -> [""]
#balancedParens 1 -> ["()"]
#balancedParens 2 -> ["()()","(())"]
#balancedParens 3 -> ["()()()","(())()","()(())","(()())","((()))"]
print([i for i in (list(map(lambda n: ''.join(n),list(permutations(s))))) if i.startswith('(') and i.endswith(')')])
['(())', '(())', '()()', '()()', '(())', '(())', '()()', '()()']
print(set([i for i in (list(map(lambda n: ''.join(n),list(permutations(s))))) if i.startswith('(') and i.endswith(')')]))
{'()()', '(())'} # made a set for all the unique combinations