A Berge cycle of length $\ell$ in a hypergraph $\mathcal{H}$ is a sequence of alternating vertices and edges $v_0e_0v_1e_1...v_\ell e_\ell v_0$ such that $\{v_i,v_{i+1}\}\subseteq e_i$ for all $i$, with indices taken modulo $\ell$. For $n$ sufficiently large and $r\geq \lfloor\frac{n-1}{2}\rfloor-1$ we prove exact minimum degree conditions for an $n$-vertex, $r$-uniform hypergraph to contain Berge cycles of every length between $2$ and $n$. In conjunction with previous work, this provides sharp Dirac-type conditions for pancyclicity in $r$-uniform hypergraphs for all $3\leq r\leq n$ when $n$ is sufficiently large.