Cherry Pickup
Explore how to apply dynamic programming strategies to solve the Cherry Pickup problem in a grid. Understand the steps to navigate through cells, collect cherries, avoid thorns, and maximize your score by efficiently planning a path from the top-left to bottom-right corner and back. This lesson builds skills in optimization and pathfinding useful for complex coding interview questions.
We'll cover the following...
Statement
You are given an grid representing a field of cherries. Each cell in the grid can have one of three possible values:
: An empty cell that can be walked through : A cell containing a cherry that can be picked and then passed through : A cell containing a thorn, which cannot be crossed
Your task is to find the maximum number of cherries that can be collected while following these rules:
Start at the top-left corner
...