| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1974|[Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1974.java)||Easy||

|1968|[Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1968.java)||Medium||

|1967|[Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1967.java)||Easy||

|1961|[Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1961.java)||Easy||

packagecom.fishercoder.solutions;

publicclass_1974 {

publicstaticclassSolution1 {

publicintminTimeToType(Stringword) {

intmin =0;

charcurr ='a';

for (inti =0;i <word.length();i++) {

intdiff =curr -word.charAt(i);

curr =word.charAt(i);

min +=Math.min(diff +26,Math.min(Math.abs(diff),26 -diff));

min++;

}

returnmin;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1974;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1974Test {

privatestatic_1974.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1974.Solution1();

}

publicvoidtest1() {

assertEquals(5,solution1.minTimeToType("abc"));

}

publicvoidtest2() {

assertEquals(7,solution1.minTimeToType("bza"));

}

publicvoidtest3() {

assertEquals(34,solution1.minTimeToType("zjpc"));

}

}