solve srectangle overlap

Author: anishLearnsToCode

Diff for: README.md

@@ -1,7 +1,7 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-194/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-194/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-195/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-195/2081-1abc9c.svg)
 ![problems-solved-python](https://img.shields.io/badge/Python-186/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
@@ -225,7 +225,7 @@
 | 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [![Java](assets/java.png)](src/GoatLatin.java) |
 | 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [![Java](assets/java.png)](src/PositionsOfLargeGroups.java) |
 | 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [![Java](assets/java.png)](src/FlippingAnImage.java) |
-| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | |
+| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [![Java](assets/java.png)](src/RectangleOverlap.java) |
 | 840 | [Magic Squares in Grid](https://leetcode.com/problems/magic-squares-in-grid) | |
 | 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | |
 | 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | |

Diff for: src/RectangleOverlap.java

@@ -0,0 +1,27 @@
+public class RectangleOverlap {
+    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
+        Rectangle rectangle1 = new Rectangle(rec1);
+        Rectangle rectangle2 = new Rectangle(rec2);
+        return hasXIntersection(rectangle1, rectangle2) && hasYIntersection(rectangle1, rectangle2);
+    }
+
+    private boolean hasXIntersection(Rectangle rec1, Rectangle rec2) {
+        return (rec1.x1 <= rec2.x1 && rec2.x1 < rec1.x2)
+                || (rec2.x1 < rec1.x1 && rec1.x1 < rec2.x2);
+    }
+
+    private boolean hasYIntersection(Rectangle rec1, Rectangle rec2) {
+        return (rec1.y1 <= rec2.y1 && rec2.y1 < rec1.y2)
+                || (rec2.y1 < rec1.y1 && rec1.y1 < rec2.y2);
+    }
+
+    private static class Rectangle {
+        private final int x1, x2, y1, y2;
+        Rectangle(int[] points) {
+            this.x1 = points[0];
+            this.y1 = points[1];
+            this.x2 = points[2];
+            this.y2 = points[3];
+        }
+    }
+}