Solution 3 for Scaler Topics Fortnightly Contest - 3

This article is part of the Scaler Topics Fortnightly Contest - 3.

Transform Your Career

Choose from our industry-leading programs designed for career success

NSDC Certified

Modern Software and AI Engineering Program

Master full-stack development with AI integration

12 MonthsDuration

AI-LedCurriculum

Career SupportSupport

+1000 more

Go to Program

NSDC Certified

Modern Data Science and ML with specialisation in AI

Advanced data science techniques with AI specialization

12 MonthsDuration

AI-LedCurriculum

Career SupportSupport

+1000 more

Go to Program

NSDC Certified

Advanced AIML with Specialisation in Agentic AI

Deep dive into AIML with focus on Agentic systems

12 MonthsDuration

AI-LedCurriculum

Career SupportSupport

+1000 more

Go to Program

NSDC Certified

DevOps, Cloud & AI Platform Engineering

Build and manage AI-powered cloud infrastructure

12 MonthsDuration

AI-LedCurriculum

Career SupportSupport

+1000 more

Go to Program

NSDC Certified

AI Engineering Advanced Certification by IIT-Roorkee

Premier AI engineering certification from IIT-Roorkee

3 MonthsDuration

AI-LedCurriculum

Career SupportSupport

Go to Program

Solution Approach

• We can use dynamic programming to calculate all possible states and get our answer.
• Our states would be dp[row][col][type], which would denote the maximum possible number of candies one can collect when reaching cell(row, col).
• The matrix (whether it is matrix C or D) of the corresponding cell would be denoted using "type" state.
• If type is equals to 0, then we are in matrix C and if type is equals to 1, then we are in matrix D.
• Our final answer would be maximum of dp[A - 1][B - 1][0] and dp[A - 1][B - 1][1].

C++ Implementation

Java Implementation

Hiring Partners:

GoogleAmazonMicrosoftFlipkartAdobe1200+ more

Python Implementation