Leetcode 1363. Largest Multiple of Three

Select a subset of the given digits and arrange them to form the largest possible number divisible by three (or return an empty string if none), returned as a string without unnecessary leading zeros. The core challenge is choosing minimal deletions using digits' values modulo 3 to make the sum divisible by 3, then ordering the remaining digits in descending order.