SpaceX | Software Engineer (Starlink) | Coding | Online Assessment

You are given an M × M grid where each cell contains an integer representing the number of candies in that cell. A bug starts at the top right corner and must reach the bottom right corner. Each time the bug enters a cell, it collects all candies from that cell. The bug may only move down or right. Determine the maximum number of candies the bug can collect along a valid path. Describe a DFS based solution and analyz...