Maximum Candies

CodeChefOpen on judge ↗

Problem description. Impressed with Agnes' jumping skills, Gru has decided to build a new game for her. Gru has laid out a grid of N x M tiles, and each tiles contains some (positive) number of candies. The rules of the games are as following: - Agnes starts from the tile (0, 0) // 0 based index - She has to reach the tile (N-1, M-1) - At a time she can either move in +x direction by 1 tile or

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI