initialize a string array with the numbers 1 thru n. Use a right pointer at the end of the array and left pointer at the beginning of the array. Make the array value at the left pointer equal to the combination of the right and left. Keep working inward until the left and right cross, then reset left to 0 and repeat until finally right is also 0 and you're done.

```
public string FindContestMatch(int n)
{
string[] arr = new string[n];
for (int i = 0; i < n; i++) arr[i] = (i + 1).ToString();
int left = 0;
int right = n - 1;
while (left < right)
{
while (left < right)
{
arr[left] = "(" + arr[left] + "," + arr[right] + ")";
left++;
right--;
}
left = 0;
}
return arr[0];
}
```