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

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

|1450|[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1450.java)||Easy|Array|

|1448|[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1448.java)||Medium|Tree, DFS|

|1447|[Simplified Fractions](https://leetcode.com/problems/simplified-fractions/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1447.java)||Medium|Math|

|1446|[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java)||Easy|String|

packagecom.fishercoder.solutions;

publicclass_1450 {

publicstaticclassSolution1 {

publicintbusyStudent(int[]startTime,int[]endTime,intqueryTime) {

intcount =0;

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

if (startTime[i] <=queryTime &&endTime[i] >=queryTime) {

count++;

}

}

returncount;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1450;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticjunit.framework.TestCase.assertEquals;

publicclass_1450Test {

privatestatic_1450.Solution1solution1;

privatestaticint[]startTime;

privatestaticint[]endTime;

publicstaticvoidsetup() {

solution1 =new_1450.Solution1();

}

publicvoidtest1() {

startTime =newint[]{1,2,3};

endTime =newint[]{3,2,7};

assertEquals(1,solution1.busyStudent(startTime,endTime,4));

}

}