Solution: Cherry Pickup

Explore how to solve the Cherry Pickup problem using dynamic programming by modeling two synchronized traversals across a grid. Understand the state memoization and recursion strategy that maximizes cherry collection while avoiding obstacles in an n by n grid.