741. Cherry Pickup

LeetCodeArrayDynamic ProgrammingMatrixOpen on judge ↗

You are given an n x n grid representing a field of cherries, each cell is one of three possible integers. - 0 means the cell is empty, so you can pass through, - 1 means the cell contains a cherry that you can pick up and pass through, or - -1 means the cell contains a thorn that blocks your way. Return the maximum number of cherries you can collect by following the rules below: - Starting a

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