On Two Combinatorial Reconfiguration Problems: Reachability And Hamiltonicity