Given two integer arrays startTime and endTime and given an integer queryTime.

The ith student started doing their homework at the time startTime[i] and finished it at time endTime[i].

Return the number of students doing their homework at time queryTime. More formally, return the number of students where queryTime lays in the interval [startTime[i], endTime[i]] inclusive.

&nbsp;
Example 1:

Input: startTime = [1,2,3], endTime = [3,2,7], queryTime = 4
Output: 1
Explanation: We have 3 students where:
The first student started doing homework at time 1 and finished at time 3 and wasn't doing anything at time 4.
The second student started doing homework at time 2 and finished at time 2 and also wasn't doing anything at time 4.
The third student started doing homework at time 3 and finished at time 7 and was the only student doing homework at time 4.


Example 2:

Input: startTime = [4], endTime = [4], queryTime = 4
Output: 1
Explanation: The only student was doing their homework at the queryTime.


&nbsp;
Constraints:


	startTime.length == endTime.length
	1 &lt;= startTime.length &lt;= 100
	1 &lt;= startTime[i] &lt;= endTime[i] &lt;= 1000
	1 &lt;= queryTime &lt;= 1000


class Solution(object):
    def busyStudent(self, startTime, endTime, queryTime):
        res = 0
        for i in range(len(startTime)):
            if startTime[i] <= queryTime <= endTime[i]:
                res += 1
            else:
                pass
        return res
class Solution {
    public int busyStudent(int[] startTime, int[] endTime, int queryTime) {
        int count = 0;
        for (int i = 0; i < startTime.length; ++i) {
            if (queryTime>=startTime[i] && queryTime<=endTime[i]) ++count;
        }
        return count;
    }
}
class Solution {
public:
    int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
        int ans = 0 ;
        for(int i = 0 ; i < size(startTime); ++i )
            if(queryTime >= startTime[i] and queryTime <= endTime[i]) ++ans ;
        
        return ans ;
    }
};
var busyStudent = function(startTime, endTime, queryTime) {
    let res = 0;

    for (let i = 0; i < startTime.length; i++) {
        if (startTime[i] <= queryTime && endTime[i] >= queryTime) res++;
    }

    return res;
};
Number of Students Doing Homework at a Given Time