Class Solution


  • public class Solution
    extends Object
    1796 - Second Largest Digit in a String\. Easy Given an alphanumeric string `s`, return _the **second largest** numerical digit that appears in_ `s`_, or_ `-1` _if it does not exist_. An **alphanumeric** string is a string consisting of lowercase English letters and digits. **Example 1:** **Input:** s = "dfa12321afd" **Output:** 2 **Explanation:** The digits that appear in s are [1, 2, 3]. The second largest digit is 2. **Example 2:** **Input:** s = "abc1111" **Output:** -1 **Explanation:** The digits that appear in s are [1]. There is no second largest digit. **Constraints:** * `1 <= s.length <= 500` * `s` consists of only lowercase English letters and/or digits.
    • Constructor Detail

      • Solution

        public Solution()
    • Method Detail

      • secondHighest

        public int secondHighest​(String s)