How to prove NP-hardness of a Hamiltonian Path problem by reducing longest-path problem?
Suppose you have a graph $G$ of order $n$. $G$ has a simple path of length $\geq n - 1$ if and only if $G$ has a hamiltonian path.