Do these two shifts overlap
Time-and-a-half rules ban one person covering two shifts at once. Minutes are counted from midnight; decide whether two shift windows share any time at all.
- A shift ends exactly when the next begins: that is still a handover, not an overlap.
- Shifts never wrap past midnight here.
shiftsOverlap(firstStart: int, firstEnd: int, secondStart: int, secondEnd: int) → bool
Java needs a compiler and Drill does not host one yet, so this page is the reference rather than an exercise: the problem, worked examples, and the solution in full. To type it out, the same problem runs in Python.
Where you start
boolean shiftsOverlap(int firstStart, int firstEnd, int secondStart, int secondEnd) {
}Worked examples
| Call | Result |
|---|---|
shiftsOverlap(480, 900, 840, 1020) | true |
shiftsOverlap(480, 900, 900, 1020) | false |
shiftsOverlap(480, 840, 900, 1020) | false |
shiftsOverlap(480, 900, 500, 600) | true |
Hint
Two windows overlap exactly when each starts before the other ends.
Reference solution in Java
boolean shiftsOverlap(int firstStart, int firstEnd, int secondStart, int secondEnd) {
return firstStart < secondEnd && secondStart < firstEnd;
}