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

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

|1936|[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java)||Medium||

|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|

packagecom.fishercoder.solutions;

publicclass_1936 {

publicstaticclassSolution1 {

publicintaddRungs(int[]rungs,intdist) {

intaddons =0;

intcurrentHeight =0;

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

intnextRung =rungs[i];

if (nextRung -currentHeight <=dist) {

currentHeight =nextRung;

i++;

}else {

intadds = (nextRung -currentHeight -1) /dist;

addons +=adds;

currentHeight +=dist *adds;

}

}

returnaddons;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1936;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1936Test {

privatestatic_1936.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1936.Solution1();

}

publicvoidtest1() {

assertEquals(2,solution1.addRungs(newint[]{3},1));

}

publicvoidtest2() {

assertEquals(2,solution1.addRungs(newint[]{1,3,5,10},2));

}

publicvoidtest3() {

assertEquals(0,solution1.addRungs(newint[]{3,6,8,10},3));

}

publicvoidtest4() {

assertEquals(1,solution1.addRungs(newint[]{3,4,6,7},2));

}

publicvoidtest5() {

assertEquals(0,solution1.addRungs(newint[]{5},10));

}

}