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

Solution: Cherry Pickup

Explore how to apply dynamic programming to solve the Cherry Pickup problem on an n×n grid. Learn to model simultaneous paths, use memoization, and efficiently find the maximum cherries collectible while adhering to movement and obstacle 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

  • ...