Leetcode 573. Squirrel Simulation

Given a grid with one squirrel, one tree, and multiple nuts where the squirrel can carry one nut at a time and movement cost is Manhattan distance, compute the minimum total steps to bring all nuts to the tree by choosing the optimal nut to fetch first to minimize extra travel.