solves number of students doing homework at given time

Author: anishLearnsToCode

Diff for: README.md

@@ -368,7 +368,7 @@
 | 1437 | [Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away)                |                                                        [![Java](assets/java.png)](src/CheckIfAll1sAreAtLeastKPlacesAway.java)                                                        |                                                                                                                                   |
 | 1441 | [Build An Array With Stack Operation](https://leetcode.com/problems/build-an-array-with-stack-operations)                                            |                                                         [![Java](assets/java.png)](src/BuildAnArrayWithStackOperations.java)                                                         |                                                                                                                                   |
 | 1446 | [Consecutive Characters](https://leetcode.com/problems/consecutive-characters)                                                                       |                                                              [![Java](assets/java.png)](src/ConsecutiveCharacters.java)                                                              |                                                                                                                                   |
-| 1450 | [Number of Students Doing Homework at Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)                   |                                                                                                                                                                                      |                                                                                                                                   |
+| 1450 | [Number of Students Doing Homework at Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)                   |                                                    [![Java](assets/java.png)](src/NumberOfStudentsDoingHomeworkAtGivenTime.java)                                                     |                                                                                                                                   |
 | 1455 | [Check If Word Occurs as Prefix of any Word in Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |                                                                                                                                                                                      |                                                                                                                                   |
 | 1460 | [Make 2 Arrays Equal by Reversing Sub Arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays)                           |                                                                                                                                                                                      |                                                                                                                                   |
 | 1464 | [Maximum Product of 2 Elements in Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array)                                  |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/NumberOfStudentsDoingHomeworkAtGivenTime.java

@@ -0,0 +1,11 @@
+public class NumberOfStudentsDoingHomeworkAtGivenTime {
+    public int busyStudent(int[] startTime, int[] endTime, int queryTime) {
+        int students = 0;
+        for (int index = 0 ; index < startTime.length ; index++) {
+            if (startTime[index] <= queryTime && queryTime <= endTime[index]) {
+                students++;
+            }
+        }
+        return students;
+    }
+}