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

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

|1935|[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java)||Easy|String|

|1929|[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1929.java)||Easy||

|1926|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java)||Medium|DP, DFS, BFS|

|1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java)||Easy|Array, Greedy|

packagecom.fishercoder.solutions;

publicclass_1935 {

publicstaticclassSolution1 {

publicintcanBeTypedWords(Stringtext,StringbrokenLetters) {

String[]words =text.split(" ");

intcount =0;

for (Stringword :words) {

booleanbroken =false;

for (charc :word.toCharArray()) {

if (brokenLetters.indexOf(c) != -1) {

broken =true;

break;

}

}

if (!broken) {

count++;

}

}

returncount;

}

}

}