Though adjoint functors provide a universal description for many concrete mathematical constructions, these constructions usually revolve around finding a single "canonical" way to transform one type of object into another. For example, the only commonly mentioned pair of adjoint functors $(L \vdash R): \mathrm{Grp} \rightarrow \mathrm{Set}$ has $L$ as the free functor and $R$ as the forgetful functor, and the same seems to be true for any two categories where the notions of free and forgetful functor make sense. However, there is more than one "nice" pair of adjoint functors $(L \vdash R): \mathrm{Set} \rightarrow \mathrm{Cat}$; take $L$ to be the functor that forgets arrows and $R$ the indiscrete-category functor, or take $L$ to be the functor sending a category to its set of connected components (and acting similarly on arrows in $\mathrm{Cat}$) and $R$ the discrete-category functor.
Are there any more instances where there are two different pairs of adjoint functors (going in the same direction, so this would entail two non-isomorphic functors each of which have a right adjoint) with similarly "nice" descriptions between given inequivalent concrete categories? Especially interesting would be different adjoint pairs where there is already a free-forgetful adjunction.
Sure. For example, there are (at least) two interesting forgetful functors from commutative rings to abelian groups: the underlying additive group, and the multiplicative group of units. Their left adjoints are, respectively, the symmetric algebra $A \mapsto S(A)$ and the group algebra $A \mapsto \mathbb{Z}[A]$.