Solution: Cherry Pickup

Explore a dynamic programming approach to solve the Cherry Pickup problem by simultaneously simulating two synchronized paths on an n×n grid. Understand how to implement a 3D memoization table to optimize path exploration and maximize cherries collected while handling obstacles and avoiding double counting.