Mooh
Reputation: 1247
Looking for a combinatorial problem definition
We are given "N" pairs of parentheses, ie "N" opening parenthesis "(" and "N" closing parenthesis ")". We are asked to find the number of ways to make Sequence of 2N parentheses that are GOOD, i.e. we dont close before opening.
I need to find a definition for GOOD Sequences that i can use for the rest of the problem.
Upvotes: 1
Views: 273
Answers (1)
Related Questions
- combinatorics for programmers?
- Can this problem be solved using combinatorics?
- Combinatorics Algorithm
- Grouped Combinations Algorithm
- Optimizing this combinatorics algorithm
- Simple combinatorics
- A teacher's algorithm
- Combinatorics: Trying to figure algorithm (about subsets)
- Modelling combinatorial optimization? problem
- algorithm to combinatorics