We have 2 nested `for` loops: the outer one runs $n-1$ times, while the inner varies from $n-1$ to $1$, so $n/2$ on average. Big O notation usually excludes all but the fastest-growing factor, so multiplying the two produces $O(n-1 \times n/2) = O(n \times n) = O(n^2)$.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence