Reach the number in minimum steps
Haskell, 82 73 bytes



r=read.reverse.show
f 1=0
f a=1+(minimum$f(a-1):[f$r a|r a&lt;a,mod a 10&gt;0])


Try it online!

Simplest recursion method.

-9 bytes thanks to Christian Sievers