Given an alphanumeric string
s, return the second largest numerical digit that appears in
-1 if it does not exist.
An alphanumeric string is a string consisting of lowercase English letters and digits.
Input: s = "dfa12321afd" Output: 2 Explanation: The digits that appear in s are [1, 2, 3]. The second largest digit is 2.
Input: s = "abc1111" Output: -1 Explanation: The digits that appear in s are . There is no second largest digit.
1 <= s.length <= 500
sconsists of only lowercase English letters and/or digits.