solves second largest digit in a string

Author: anishLearnsToCode

README.md

@@ -437,7 +437,7 @@
 | 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                  [![Java](assets/java.png)](src/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java)                                                   |                                                                                                                                   |
 | 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)                          |                                                     [![Java](assets/java.png)](src/CheckIfOneStringSwapCanMakeStringsEqual.java)                                                     |                                                                                                                                   |
 | 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph)                                                                      |                                                              [![Java](assets/java.png)](src/FindCenterOfStarGraph.java)                                                              |                                                                                                                                   |
-| 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string)                                                        |                                                                                                                                                                                      |                                                                                                                                   |
+| 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string)                                                        |                                                           [![Java](assets/java.png)](src/SecondLargestDigitInAString.java)                                                           |                                                                                                                                   |
 | 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum)                                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1805 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string)                                        |                                                                                                                                                                                      |                                                                                                                                   |
 | 1812 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square)                                            |                                                                                                                                                                                      |                                                                                                                                   |

src/SecondLargestDigitInAString.java

@@ -0,0 +1,18 @@
+public class SecondLargestDigitInAString {
+    public int secondHighest(String s) {
+        int largestDigit =  -1, secondLargestDigit = -1;
+        for (int index = 0 ; index < s.length() ; index++) {
+            if (Character.isDigit(s.charAt(index))) {
+                int digit = s.charAt(index) - '0';
+                if (digit > largestDigit) {
+                    int temp = largestDigit;
+                    largestDigit = digit;
+                    secondLargestDigit = temp;
+                } else if (digit < largestDigit && digit > secondLargestDigit) {
+                    secondLargestDigit = digit;
+                }
+            }
+        }
+        return secondLargestDigit;
+    }
+}