We determine all repdigits (decimal numbers consisting of a single repeated digit) which can be written as the product of a Narayana number and a Fibonacci number. Using Binet-type expressions for both sequences, Matveev’s explicit lower bounds for linear forms in logarithms, and a Dujella–Petho˝ (Baker– Davenport type) reduction, we reduce the problem to a finite computation and perform an exhaustive search.