Please can someone help me with this question:\nFind the longest path in the maze. Start from any cell in the top row and the last cell in your path has to be in the bottom row. There are obstacles in the maze. No cell can be visited more than once. Traverse only Adjacent cells (Up,down,right,left)\nIn the below example 1-obstacle, 0-valid cell. \n\n11**00**101\n11**0**1101\n11**000**10\n10**00000**\n1111**000**\n\nThanks **@mdu_**\nUpdate Path: \n(0,3)->(0,2)->(1,2)->(2,2)->(3,2)->(3,3)->(2,3)->(2,4)->(3,4)->(3,5)->(3,6)->(4,6)->(4,5)->(4,4)\nAns:14\nI had solved it using DFS with backtracking. Any thoughts?\n\nThanks **@nasus**\nQuestion updated: (to consider only down,left and right cells)\nFind the longest path in the maze. Start from any cell in the top row and the last cell in your path has to be in the bottom row. There are obstacles in the maze. No cell can be visited more than once. Traverse only Adjacent cells (down,right,left)\nIn the below example 1-obstacle, 0-valid cell. \n\n11**00**101\n11**0**1101\n11**0**0010\n10**00000**\n1111**000**\n\nPath: (considering only down)\n(0,3)->(0,2)->(1,2)->(2,2)->(3,2)->(3,3)->(3,4)->(3,5)->(3,6)->(4,6)->(4,5)->(4,4)\nAns:12\nHow to solve this using DP?\n

Please can someone help me with this question:\nFind the longest path in the maze. Start from any cell in the top row and the last cell in your path has to be i