Leetcode 2259. Remove Digit From Number to Maximize Result

Given a numeric string and a target digit that occurs at least once, remove exactly one occurrence of that digit so the remaining string represents the largest possible integer. The core challenge is selecting which occurrence to remove (a greedy positional choice) while preserving the original order.