The answer to the GRE question is $3$. The graphs intersect once to the left of the $y$-axis, and twice to the right.
For the general question, here is one suggestion for a possible solution, and a sketch of the construction.
For any $n$ we can construct a polynomial that intersects $e^x$ $n+1$ times. For even $n$, place $n/2$+1 points with different $x$-values above the graph of $e^x$. Place $n/2$ points below the graph of $e^x$ such that their $x$-values alternate with those of the other points. There is then a unique polynomial of degree $n$ containing the $n+1$ points we've chosen. The intermediate value theorem then shows the two graphs intersect $n$ times within the region determined by the chosen points. The extra intersection comes beyond the region when $e^x$ overtakes the polynomial.
The case is similar for odd $n$, making sure the leading coefficient of the polynomial is positive.
To see this is maximal, apply the mean value theorem to the equation $p(x)-e^x=0$ where $p(x)$ is a polynomial of degree $n$. Differentiating $n+1$ times gives the equation $e^x=0$ which has no solutions. It follows that $p^{(n)}(x)-e^x=0$ has at most $1$ solution, $p^{(n-1)}(x)-e^x=0$ has at most $2$ solutions, etc. Thus $p(x)-e^x=0$ has at most $n+1$ solutions.