1450. Number of Students Doing Homework at a Given Time LeetCode Solution
In this guide, you will get 1450. Number of Students Doing Homework at a Given Time LeetCode Solution with the best time and space complexity. The solution to Number of Students Doing Homework at a Given Time problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Number of Students Doing Homework at a Given Time
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.
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.
1450. Number of Students Doing Homework at a Given Time LeetCode Solution in C++
class Solution {
public:
int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
const int n = startTime.size();
int ans = 0;
for (int i = 0; i < n; ++i)
if (startTime[i] <= queryTime && queryTime <= endTime[i])
++ans;
return ans;
}
}; /* code provided by PROGIEZ */
1450. Number of Students Doing Homework at a Given Time LeetCode Solution in Java
N/A // code provided by PROGIEZ
1450. Number of Students Doing Homework at a Given Time LeetCode Solution in Python
