Day 3 builds a number from digits by picking a subsequence with the largest possible value, and the same greedy approach powers both parts.
We will unpack the problem requirements at a high level, then walk through a compact Python solution that selects the maximum value subsequence per digit …