23242526272829303132333435363738394041424344454647484950515253545556575859606162636465

class Solution:
    """ Recursive function to calculate the 
    maximum points for the ninja training"""
    def func(self, day, last, points, dp):
        """ Check if the result for this day and 
        last activity is already computed."""
        if dp[day][last] != -1:
            return dp[day][last]
        
        # Base case
        if day == 0:
            maxi = 0
        
            """ Calculate the maximum points for the first day
            by choosing an activity different from last one"""
            for i in range(3):
                if i != last:
                    maxi = max(maxi, points[0][i])
            
            # Store maximum points in the DP table and return it.
            dp[day][last] = maxi
            return dp[day][last]

        # Initialize max points for the current day
        maxi = 0
        
        # Iterate through activities for the current day
        for i in range(3):
            if i != last:
                """Calculate the points for the current activity
                and add it to the maximum points obtained so far"""
                activity = points[day][i] + self.func(day - 1, i, points, dp)
                maxi = max(maxi, activity)

        # Store maximum points in the DP table and return it.
        dp[day][last] = maxi
        return dp[day][last]

    # Function to find the maximum points for ninja training
    def ninjaTraining(self, points):
        # Get the number of days
        days = len(points)
        
        # Initialize a DP table to store the computed results.
        dp = [[-1 for j in range(4)] for i in range(days)]
        
        # If there are no days, return 0
        if days == 0:
            return 0

        # Return the maximum points
        return self.func(days - 1, 3, points, dp)

points = [
    [10, 40, 70],
    [20, 50, 80],
    [30, 60, 90]
]

# Create an instance of Solution class
sol = Solution()

# Print the maximum points for ninja training
print(sol.ninjaTraining(points))  # Output should be 210

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071

class Solution {
    /* Recursive function to calculate the 
    maximum points for the ninja tra