3363. Find the Maximum Number of Fruits Collected

Given an n×n matrix fruits. Three children start at the corners (0,0), (0,n−1), (n−1,0) and, in n−1 steps, walk to (n−1,n−1), collecting fruits (each cell counted once). The first goes diagonally;…