  In this paper, we give a solution to the last outstanding case of the
directed Oberwolfach problem with tables of uniform length. Namely, we address
the two-table case with tables of odd length. We prove that the complete
symmetric digraph on $2m$ vertices, denoted $K^*_{2m}$, admits a resolvable
decomposition into directed cycles of odd length $m$. This completely settles
the directed Oberwolfach problem with tables of uniform length.
