Collected Them All?

The card series has cards numbered 1 to n — is your (messy, repeat-filled) pile a COMPLETE collection? 🏆

You get n and your pile of card nums. Print complete if every card from 1 to n appears at least once, or incomplete.

Example:

Input: n = 5, nums = [3, 1, 4, 1, 5, 2, 2] Output: complete

The pile's set is {1, 2, 3, 4, 5}, which contains every number from 1 to 5 — a complete collection despite the repeats.