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

5 votes113 views1 answer
Check is lowercase
Python
4 votes116 views4 answers
Python recursion example
Python
1 vote133 views2 answers
Define symmetry
Python
49 votes123 views6 answers
Python run command
Python
26 votes131 views4 answers
Python download youtube video
Python
5 votes118 views4 answers
While true loop python
Python
0 vote126 views1 answer
Python program running time
Python
0 vote103 views1 answer
Python valueerror "invalid syntax for number"
Python
2 votes148 views1 answer
Django template capitalize equivalent
Python Django
2 votes133 views2 answers
Get element pandas
Python