In this paper, we study the problem of the explicit intersection of two sequences. More specifically, we find all repdigits (i.e., numbers with only one repeated digit in its decimal expansion) which can be written as the product of a Fibonacci by a Tribonacci number (both with the same indexes). To work on this problem, our approach is to combine lower bounds from the Baker's theory with reduction methods (based on the theory of continued fractions) due to Dujella and Pethö.