My previous answer contained a fatal flaw in logic, caused by not taking the absolute value of the determinant of the Jacobian in the change of variables theorem. The following is a more precise answer.
Let $X$ have pdf $f_X(x)$, $Y$ have pdf $f_Y(y)$, and $Y=g(X)$.
By the change of variables theorem (sketches of the proof of which can be found in a previous MSE post Intuitive proof of multivariable changing of variables formula (jacobian) without using mapping and/or measure theory?, we have
$f_Y(y)=f_X(g^{-1}(y))\cdot \left| D_y g^{-1}(y) \right| $
Now, for this question, we are interested in the case where $f_X=f_Y=g$. Call this $f$.
Then the change of variables equation becomes
$f(y)=f\left(f^{-1}(y)\right)\cdot\left|D_y f^{-1}(y) \right|$
and we must now assume $f$ is monotonic since otherwise $f^{-1}$ does not exist as a function. Applying the chain rule, we obtain:
$f(y)=f\left(f^{-1}(y)\right) \cdot \left| \frac{1}{(D_y f) \left( f^{-1}(y) \right) } \right| $
Due to monotonicity,
$f(y)=y \cdot \left| \frac{1}{(D_yf)\left( f^{-1}(y) \right) } \right| $
It can easily be shown that $f(y)=ay^n$, $n=\pm1$, $a\geq0$ are sufficient to fulfill this criterion, but I'm not sure how to prove they are necessary.
Wikipedia's article on Probability density functions gives an interesting formula I hadn't seen in my prob theory courses, which deals with nonmonotonic transformation functions:
$$f_Y(y)=\sum_{k=1}^{n(y)}\left|D_y g_k^{-1}(y)\right|\cdot f_X(g_k^{-1}(y))$$
where $n(y)$ is the number of $x$ such that $g(x)=y$ (essentially this is just combining the strictly increasing and strictly decreasing cases into one function). In your third case, where the density is unimodal, $n=2$ and the formula becomes:
$f(y)=\left|D_yf_1^{-1}(y)\right|\cdot f\left(f_1^{-1}(y)\right)+\left|D_yf_2^{-1}(y)\right|\cdot f\left(f_2^{-1}(y)\right)$
where $f_1, f_2$ are respectively your strictly increasing and strictly decreasing densities on their proper intervals (denoted here with indicator functions $I$):
$f_1(y)=p\frac{y-\mathcal{l}}{m-\mathcal{l}}I_{(\mathcal{l}, m]}(y)$
$f_2(y)=p\frac{1}{y-m+1}I_{(m, n]}(y)$
where $0<\mathcal{l}<m<n<\infty$ and $p=\frac{1}{\frac{m-\mathcal{l}}{2}+\ln{(n-m+1)}}$.
Since
$\left|D_yf_1^{-1}(y)\right|=\left|\frac{m-\mathcal{l}}{p}\right|=\frac{m-\mathcal{l}}{p}$ and
$\left|D_yf_2^{-1}(y)\right|=\left|-\frac{p}{y^2}\right|=\frac{p}{y^2}$
Our density becomes
$f(y)=(y-\mathcal{l})I_{(\mathcal{l}, m]}(y)+\frac{p^2}{y^2(y-m+1)}I_{(m, n]}(y)$