Ninja's Training

Problem Link: https://www.codingninjas.com/codestudio/problems/ninja-s-training_3621003?leftPanelTab=0

def ninjaTraining(n: int, points: List[List[int]]) -> int:

    # Write your code here.
    dp=[[0 for i in range(3)] for j in range(n)]
    for i in range(3):
        dp[0][i]=points[0][i]
    for i in range(1,n):
        dp[i][0]=points[i][0]+max(dp[i-1][1],dp[i-1][2])
        dp[i][1]=points[i][1]+max(dp[i-1][0],dp[i-1][2])
        dp[i][2]=points[i][2]+max(dp[i-1][0],dp[i-1][1])
    ans=0
    for i in range(3):
        ans=max(ans,dp[n-1][i])
    return ans