solves #2446: Determine if Two Events Have Conflict in java

Author: anishLearnsToCode

README.md

@@ -774,7 +774,7 @@
 | 2432 | [The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task)                                             |                                                                            [![Java](assets/java.png)](src/TheEmployeeThatWorkedOnTheLongestTask.java)                                                                            |                                                                                                                                   |
 | 2437 | [Number of Valid Clock Times](https://leetcode.com/problems/number-of-valid-clock-times)                                                                               |                                                                                   [![Java](assets/java.png)](src/NumberOfValidClockTimes.java)                                                                                   |                                                                                                                                   |
 | 2441 | [Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative)                         |                                                                       [![Java](assets/java.png)](src/LargestPositiveIntegerThatExistsWithItsNegative.java)                                                                       |                                                                                                                                   |
-| 2446 | [Determine if Two Events Have Conflict](https://leetcode.com/problems/determine-if-two-events-have-conflict)                                                           |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2446 | [Determine if Two Events Have Conflict](https://leetcode.com/problems/determine-if-two-events-have-conflict)                                                           |                                                                              [![Java](assets/java.png)](src/DetermineIfTwoEventsHaveConflict.java)                                                                               |                                                                                                                                   |
 | 2451 | [Odd String Difference](https://leetcode.com/problems/odd-string-difference)                                                                                           |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2455 | [Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three)                   |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2460 | [Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array)                                                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/DetermineIfTwoEventsHaveConflict.java

@@ -0,0 +1,32 @@
+// https://leetcode.com/problems/determine-if-two-events-have-conflict
+// T: O(1)
+// S: O(1)
+
+public class DetermineIfTwoEventsHaveConflict {
+    public boolean haveConflict(String[] event1, String[] event2) {
+        final int[] event1EpochMinutes = getEpochMinutes(event1);
+        final int[] event2EpochMinutes = getEpochMinutes(event2);
+        return isIntersecting(event1EpochMinutes, event2EpochMinutes);
+    }
+
+    private boolean isIntersecting(int[] event1, int[] event2) {
+        return Math.min(event1[1], event2[1]) >= Math.max(event1[0], event2[0]);
+    }
+
+    private int[] getEpochMinutes(String[] event) {
+        return new int[] { getEpochMinutes(event[0]), getEpochMinutes(event[1])};
+    }
+
+    private int getEpochMinutes(String event) {
+        final String hh = event.substring(0, 2), mm = event.substring(3);
+        return toInt(hh) * 60 + toInt(mm);
+    }
+
+    private int toInt(String string) {
+        int result = 0;
+        for (int index = 0 ; index < string.length() ; index++) {
+            result = 10 * result + (string.charAt(index) - '0');
+        }
+        return result;
+    }
+}