Summary: Let \(T\) be a Hamiltonian bipartite tournament with \(n\) vertices, \(\gamma\) a Hamiltonian directed cycle of \(T\), and \(k\) an even number. In this paper, the following question is studied: What is the maximum intersection with \(\gamma\) of a directed cycle of length \(k\) contained in \(T[V(\gamma)]\)? It is proved that for an even \(k\) in the range \(\frac{n+6}{2}\leq k\leq n-2\), there exists a directed cycle \({\mathcal C}_{h(k)}\) of length \(h(k)\), \(h(k)\in\{k,k-2\}\) with \(|A({\mathcal C}_{h (k)})\cap A(\gamma)|\geq h(k)-4\) and the result is best possible. In a previous paper (see the preceding item) a similar result for \(4\leq k\leq\frac{n+4}{2}\) was proved.