Breaking News: Grepper is joining You.com. Read the official announcement!

Unique BST's

Sumit Rawal answered on October 19, 2022 Popularity 7/10 Helpfulness 2/10

answer Unique BST's

Unique BST's

Comment

class Solution875{
    static int numTrees(int N){
        long mod =1000000007;
        long [] dp = new long [N+1];
        dp[0] =1;
        for(int i =1; i<=N; ++i){
            for(int j =0; j<i; ++j)
                dp[i] =(dp[i]%mod+(dp[j]%mod*dp[i-j-1]%mod)%mod)%mod;
        }
        return (int)dp[N];
    }
}

Popularity 7/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: unique whatever

Link to this answer
Share Copy Link

Contributed on Oct 19 2022

Sumit Rawal

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Unique BST's

Contents

More Related Answers

Unique BST's

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.