Finding the shortest odd-length directed cycle in a directed graph is a straightforward algorithmic problem. On the other hand, finding the shortest even-length directed cycle in a directed graph is an astonishingly subtle task, that was only very recently shown to be tractable. See The shortest even cycle problem is tractable, by Andreas Björklund, Thore Husfeldt, and Petteri Kaski.