Catalan Coding Problems

Catalan numbers are defined as a mathematical sequence that consists of positive integers, which can be used to find the number of possibilities of various combinations. 

Example problems based on Catalan Number

• Nth Catalan Number
• Make Catalan Sequence
• Count all Possible BST
• Print all Possible BST
• Binary Trees with given Inorder Traversal
• BSTs using Array Elements
• Valid Parentheses
• Distinct Regular Bracket Sequences
• Counting Polygon Triangulation
• Succinct Encoding of Binary Tree
• Dyck Path
• Dyck Words of given length
• Non-crossing lines to connect points
• Binary Trees for given Preorder Sequence length
• Permutations no Three Increasing Subsequence
  
• Possible Permutations of given Array
• Paths from top Left to Bottom Right
• Sequences having non-negative Prefix Sums