solves minimum time to type word using special typewriter

Author: anishLearnsToCode

README.md

@@ -473,7 +473,7 @@
 | 1961 | [Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array)                                                |                                                          [![Java](assets/java.png)](src/CheckIfStringIsAPrefixOfArray.java)                                                          |                                                                                                                                   |
 | 1967 | [Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word)                  |                                                   [![Java](assets/java.png)](src/NumberOfStringsThatAppearAsSubstringsInWord.java)                                                   |                                                                                                                                   |
 | 1971 | [Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph)                                                                |                                                             [![Java](assets/java.png)](src/FindIfPathExistsInGraph.java)                                                             |                                                                                                                                   |
-| 1974 | [Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter)                    |                                                                                                                                                                                      |                                                                                                                                   |
+| 1974 | [Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter)                    |                                                   [![Java](assets/java.png)](src/MinimumTimeToTypeWordUsingSpecialTypewriter.java)                                                   |                                                                                                                                   |
 | 1979 | [Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array)                                              |                                                                                                                                                                                      |                                                                                                                                   |
 | 1984 | [Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores)      |                                                                                                                                                                                      |                                                                                                                                   |
 | 1991 | [Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array)                                                            |                                                                                                                                                                                      |                                                                                                                                   |

src/MinimumTimeToTypeWordUsingSpecialTypewriter.java

@@ -0,0 +1,19 @@
+// https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter
+// T: O(|word|)
+// S: O(1)
+
+public class MinimumTimeToTypeWordUsingSpecialTypewriter {
+    public int minTimeToType(String word) {
+        return movingTime(word) + word.length();
+    }
+
+    private int movingTime(String s) {
+        int movingTime = 0, distance;
+        for (int i = 1 ; i < s.length() ; i++) {
+            distance = Math.abs(s.charAt(i) - s.charAt(i - 1));
+            movingTime += Math.min(distance, 26 - distance);
+        }
+        distance = Math.abs(s.charAt(0) - 'a');
+        return movingTime + Math.min(distance, 26 - distance);
+    }
+}