In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we provide explicit growth rates for the number of parking functions of length $n$ avoiding a monotonic pattern of any length. As a consequence of our techniques we additionally provide a combinatorial enumeration for the number of equivalence classes of words with a fixed content under the Sylvester congruence.