Nth catalan number

Recursion :

def findCatalan(n):
    def recur(n):
        if n == 0 or n == 1:
            return 1
        res = 0
        for i in range(n):
            res += recur(i) * recur(n-i-1)
        return res
    return recur(n)

Top down :

def findCatalan(n): 
    def top_down(n,dp):
        if dp[n] != -1:
            return dp[n]
        res = 0
        for i in range(n):
            res += top_down(i,dp) * top_down(n-i-1,dp)
        dp[n] = res
        return dp[n]
    
    dp = [-1] * (n+1)
    dp[0] = 1
    dp[1] = 1
    return top_down(n,dp)

Bottom Up:

def findCatalan(n): 
    def bottom_up(n,dp):
        for i in range(2,n+1):
            for j in range(i):
                dp[i]  += dp[j] * dp[i-j-1]
    
    dp = [0] * (n+1)
    dp[0] = 1
    dp[1] = 1
    bottom_up(n,dp) # Calling function
    return dp[n]

Source: practice.geeksforgeeks.org

Similar codes

1 vote108 views2 answers
Next prime number in python
Python
0 vote104 views1 answer
Making a txt file then write
Python
0 vote105 views1 answer
Python scheduler
Python
13 votes110 views1 answer
Selenium webdriver python
Python
2 votes103 views2 answers
Install python3.7 ubuntu 20.04
Python
6 votes104 views2 answers
Python tkinter filedialog
Python
27 votes110 views3 answers
Python check if string or list
Python
0 vote149 views1 answer
Iterate over classes in module python
Python
0 vote105 views1 answer
Python cache return value
Python
3 votes83 views3 answers
Nested loop in list comprehension
Python