The Tribonacci sequence T_n is defined as follows: 

T₀ = 0, T₁ = 1, T₂ = 1, and T_n+3 = T_n + T_n+1 + T_n+2 for n >= 0.

Given n, return the value of T_n.

Example 1:


Input: n = 4
Output: 4
Explanation:
T_3 = 0 + 1 + 1 = 2
T_4 = 1 + 1 + 2 = 4

Example 2:


Input: n = 25
Output: 1389537

class Solution {
    public int tribonacci(int n) {
        if (n <= 1) {
            return n;
        }
        if (n ==2){
            return 1;
        }
        int cache[] = new int [n+1];
        cache[1] = 1;
        cache[2] = 1;
        for(int i=3;i<=n;i++) {
            cache[i] = cache[i-1] + cache[i-2] + cache[i-3];
        }
        return cache[n];
    }
}

https://leetcode.com/problems/n-th-tribonacci-number/description/?envType=study-plan-v2&id=dynamic-programming