Try the Find the Missing Numbers interview problem.

You have a bag containing tiles with numbers `[1, 2, 3, …, n]` written on them. Each number appears exactly once, so there are `n` tiles and `n` numbers. Now, without looking, `k` number tiles are randomly picked out of the bag and discarded. Create a `missing_nos()` function that takes in a list and `k`, and returns the missing numbers in ascending order (from smallest to greatest).

For example, `missing_nos([1, 2, 4, 5, 6, 7, 8, 10], 2)` should return `[3, 9]`.

This challenge was reported to have been asked at interviews with Twitter. If you've covered the material in [Pass the Technical Interview with Python](https://www.codecademy.com/learn/paths/pass-the-technical-interview-with-python) or an equivalent, you should be able to solve this challenge. If you have trouble, try refreshing your knowledge there first.

Find the Missing Numbers

ENDING SOON: 50% off annual Pro memberships with code [FUTURE](https://www.codecademy.com/checkout?plan_id=proGoldAnnualV2&discountCode=FUTURE&plan_type=pro)