package leetcode;

/**
 * https://leetcode.com/problems/minimum-area-rectangle/
 */
public class Problem939 {
    public int minAreaRect(int[][] points) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem939 prob = new Problem939();
    }
}

@@ -278,16 +278,276 @@
 m939();%0A
+        System.out.println(prob.minAreaRect(new int%5B%5D%5B%5D%7B%0A            %7B1, 1%7D, %7B1, 3%7D, %7B3, 1%7D, %7B3, 3%7D, %7B2, 2%7D%0A        %7D)); // 4%0A        System.out.println(prob.minAreaRect(new int%5B%5D%5B%5D%7B%0A            %7B1, 1%7D, %7B1, 3%7D, %7B3, 1%7D, %7B3, 3%7D, %7B4, 1%7D, %7B4, 3%7D%0A        %7D)); // 2%0A
     %7D%0A%7D%0A

Update problem 939