solves slowest key

Author: anishLearnsToCode

README.md

@@ -404,7 +404,7 @@
 | 1614 | [Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses)                                        |                                                       [![Java](assets/java.png)](src/MaximumNestingDepthOfTheParentheses.java)                                                       |                                                                                                                                   |
 | 1619 | [Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements)                                    |                                                      [![Java](assets/java.png)](src/MeanOfArrayAfterRemovingSomeElements.java)                                                       |                                                                                                                                   |
 | 1624 | [Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters)                            |                                                    [![Java](assets/java.png)](src/LargestSubStringBetweenTwoEqualCharacters.java)                                                    |                                                                                                                                   |
-| 1629 | [Slowest Key](https://leetcode.com/problems/slowest-key)                                                                                                  |                                                                                                                                                                                      |                                                                                                                                   |
+| 1629 | [Slowest Key](https://leetcode.com/problems/slowest-key)                                                                                                  |                                                                   [![Java](assets/java.png)](src/SlowestKey.java)                                                                    |                                                                                                                                   |
 | 1636 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency)                                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 1640 | [Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation)                                  |                                                                                                                                                                                      |                                                                                                                                   |
 | 1646 | [Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array)                                                            |                                                                                                                                                                                      |                                                                                                                                   |

src/SlowestKey.java

@@ -0,0 +1,15 @@
+public class SlowestKey {
+    public char slowestKey(int[] releaseTimes, String keysPressed) {
+        char slowestKey = keysPressed.charAt(0);
+        int longestDuration = releaseTimes[0];
+        for (int index = 1 ; index < keysPressed.length() ; index++) {
+            if (releaseTimes[index] - releaseTimes[index - 1] > longestDuration) {
+                longestDuration = releaseTimes[index] - releaseTimes[index - 1];
+                slowestKey = keysPressed.charAt(index);
+            } else if (releaseTimes[index] - releaseTimes[index - 1] == longestDuration) {
+                slowestKey = (char) Math.max(slowestKey, keysPressed.charAt(index));
+            }
+        }
+        return slowestKey;
+    }
+}