packageeasy;

publicclassRectangleArea {

publicintcomputeArea(intA,intB,intC,intD,intE,intF,intG,intH) {

intareaA = (C-A)*(D-B);

intareaB = (G-E)*(H-F);

inttop =Math.min(D,H);

intbottom =Math.max(B,F);

intleft =Math.max(A,E);

intright =Math.min(C,G);

intoverlap =0;

if(top >bottom &&right >left)overlap = (top -bottom)*(right -left);

returnareaA +areaB -overlap;

}

}

|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)|[Solution](../../blob/master/EASY/src/easy/FirstBadVersion.java)| O(logn)|O(1) | Easy| Binary Search

|273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)|[Solution]|

|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)|[Solution](../../blob/master/EASY/src/easy/BinaryTreePaths.java) | O(n*h) | O(h) | DFS/Recursion

|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)|[Solution](../../blob/master/EASY/src/easy/RectangleArea.java)| O(1)|O(1)| Easy|

|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)|[Solution](../../blob/master/MEDIUM/src/medium/MinimumSizeSubarraySum.java)| O(n)|O(1)| Medium|

|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[Solution](../../blob/master/EASY/src/easy/ReverseLinkedList.java)| O(n)|O(1) | Easy

|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)|[Solution](../../blob/master/EASY/src/easy/IsomorphicStrings.java)| O(n)|O(1) | Easy