██████╗ ██████╗ ██████╗ ███████╗ ███████╗███╗ ██╗ █████╗ ████████╗ ██████╗██╗ ██╗██╔════╝██╔═══██╗██╔══██╗██╔════╝ ██╔════╝████╗ ██║██╔══██╗╚══██╔══╝██╔════╝██║ ██║██║ ██║ ██║██║ ██║█████╗ ███████╗██╔██╗ ██║███████║ ██║ ██║ ███████║██║ ██║ ██║██║ ██║██╔══╝ ╚════██║██║╚██╗██║██╔══██║ ██║ ██║ ██╔══██║╚██████╗╚██████╔╝██████╔╝███████╗ ███████║██║ ╚████║██║ ██║ ██║ ╚██████╗██║ ██║ ╚═════╝ ╚═════╝ ╚═════╝ ╚══════╝ ╚══════╝╚═╝ ╚═══╝╚═╝ ╚═╝ ╚═╝ ╚═════╝╚═╝ ╚═╝

Community Problem

Cherry Pickup

Difficulty: Hard

Maximize cherries collected by walking from top-left to bottom-right and back, modeled as two simultaneous forward walks with shared cells counted once.

Cherry Pickup

Maximize cherries collected by walking from top-left to bottom-right and back, modeled as two simultaneous forward walks with shared cells counted once.

HARD

$9.99

dynamic-programming

grid-dp

matrix-algorithms

By @leoeriksson

January 26, 2026

Updated May 20, 2026

1,092 views

4.5 (12)

Problem statement is locked. Purchase this item to view the full content.

Solution

Starter code, test cases, and solutions are locked.

Purchase this item to access the full workspace.

All Problems