> Later on, I reduced another interviewer's search problem to a polynomial equation that had integer roots when a solution existed
well, you can reduce any computable problem to that form
well, you can reduce any computable problem to that form
Whether it is a fast algorithm depends heavily on the sizes of the first and last coefficients, as you have to factorize them.