# Problem Definition

## Description

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses of length 2*n.

For example, given n = 3, a solution set is:

```plaintext
"((()))", "(()())", "(())()", "()(())", "()()()"
```

Make sure the returned list of strings are sorted.

## Notes

1. [GeeksForGeeks](https://www.geeksforgeeks.org/print-all-combinations-of-balanced-parentheses/)
1. [LeetCode discussion](https://leetcode.com/problems/generate-parentheses/discuss/10100/Easy-to-understand-Java-backtracking-solution)