Daily challenge for 2026-11-09
678. Parcel Code Check Digits
You are given a list of strings codes, where each string represents a parcel tracking code consisting only of ASCII digits ('0' through '9').
For each parcel code, compute its check digit, defined as the sum of all its digits modulo 10. Return a list of integers representing the check digit for each code in the original order.
Constraints:
There are 0–1,000 codes. Every code is a non-empty string of 1–100 ASCII digits. Leading zeroes are part of the code and are preserved in the input. Each output check digit is an integer from 0 to 9.
Example:
Input: codes = ["1234", "005", "999"]
Output: [0, 5, 7]
Run this challenge interactively in Python or JavaScript when the app loads.