How to verify the solution to n queens problem
I suspect what they meant was that if you are given a placement of $n$ queens, you can verify in quadratic time whether that is a valid solution (i.e., none of the queens attack any of the others).

I don't know of any way to verify the count of the number of solutions in quadratic time, and I doubt that such a thing is possible in quadratic time.