Hi, how is this question solved?I thought it was a Markov chain problem where adjacency matrix divided by degree gives the transformation matrix.But the solution is different.It uses a dp approach.Please help
Hi, how is this question solved?I thought it was a Markov chain problem where adjacency matrix divided by degree gives the transformation matrix.But the solution is different.It uses a dp approach.Please help