AbstractIn 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 equal odd length. We prove that the complete symmetric digraph on vertices, denoted , admits a resolvable decomposition into directed cycles of odd length . This completely settles the directed Oberwolfach problem with tables of uniform length.