Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Cherry Pickup

Explore the Cherry Pickup problem where you collect cherries on a grid while moving from top-left to bottom-right and back. Understand how to apply dynamic programming to efficiently compute the optimal path that maximizes cherries picked, while avoiding obstacles and adhering to movement constraints.

We'll cover the following...

Statement

You are given an n×nn \times n grid representing a field of cherries. Each cell in the grid can have one of three possible values:

  • 00: An empty cell that can be walked through

  • 11: A cell containing a cherry that can be picked and then passed through

  • −1-1: 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:

  1. Start at the top-left corner ...