Given an integer n, the task is to count Dyck words possible of length n. A DYCK word is a word containing only characters ‘X’ and ‘Y’ such that in every prefix of the word frequency(‘X’) ≥ frequency(‘Y’)
Input: n = 2
“XY” and “XX” are the only possible DYCK words of length 2.
Input: n = 5
Geometrical Interpretation: Its based upon the idea of DYCK PATH.
The above diagrams represent DYCK PATHS from (0, 0) to (n, n).
A DYCK PATH contains n horizontal line segments and n vertical line segments that doesn’t cross the segment AB.
The main idea behind this problem is to find the total number of DYCK paths from (0, 0) to (n, n).
To approach this problem the main idea is to find the total number of paths of Manhattan Distance between (0, 0) to (n, n) and exclude all those paths that cross the segment AB.
How to calculate the number of paths that cross segment AB?
Let us call all those paths that cross AB as ‘incorrect’. The ‘incorrect’ paths which crosses AB must pass through line CD.
- Take symmetry of point A across line A.
- Draw a symmetrical line of the incorrect line taking reference with CD.
A symmetrical line wrt CD.
FG-Symmetrical line of an incorrect line.
All those lines that crosses AB their symmetrical line that starts at F finishes at G(n-1, n+1).
Hence the number of incorrect lines are :
2 * nCn – 1
Hence number of DYCK words with n ‘X’ and n ‘Y’ is:
2 * nCn – 2 * nCn – 1 = (2 * n)! / (n)! * (n + 1)!
Below is the implementation of the above approach:
- Generating Lyndon words of length n
- K length words that can be formed from given characters without repetition
- Dyck path
- Number of words that can be made using exactly P consonants and Q vowels from the given string
- Java ArrayList to print all possible words from phone digits
- Maximum sum subarray of even length
- Sub-strings of length K containing same character
- Find the number of words of X vowels and Y consonants that can be formed from M vowels and N consonants
- Length of the longest Subarray with only Even Elements
- Number of K length subsequences with minimum sum
- All possible strings of any length that can be formed from a given string
- Count unique subsequences of length K
- Number of N length sequences whose product is M
- Maximize the number of segments of length p, q and r
- Number of non-decreasing sub-arrays of length less than or equal to K
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.