Can someone post recursive/ top-down approach for dp solution?
BFS solution-
If we will form the graph of n vertices then most probably output will be TLE (either using simple bfs or any optimized bfs).
TLE -
https://www.codechef.com/viewsolution/47356875
Rather think of iterating string and each move from i to → (i-1 or i+1 or jump) as an edge.