Add 406_Queue_Reconstruction_by_Height.java

Author: Sean Prashad

Arrays/406_Queue_Reconstruction_by_Height.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int[][] reconstructQueue(int[][] people) {
+        if (people == null || people.length == 0) {
+            return new int[][] {};
+        }
+
+        List<int[]> result = new ArrayList<>();
+
+        Arrays.sort(people, (p1, p2) -> p2[0] == p1[0] ? p1[1] - p2[1] : p2[0] - p1[0]);
+
+        for (int[] person : people) {
+            result.add(person[1], person);
+        }
+
+        return result.toArray(new int[result.size()][]);
+    }
+}