Added 2 solutions

varunu28 · varunu28 · commit 25200434fc45 · 2017-11-04T15:30:18.000-07:00
diff --git a/Hackerrank/Data Structures/Stacks/Largest Rectangle.java b/Hackerrank/Data Structures/Stacks/Largest Rectangle.java
@@ -0,0 +1,34 @@
+import java.io.*;
+import java.util.*;
+import java.text.*;
+import java.math.*;
+
+public class Solution {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        scanner.nextInt();
+        List<Integer> heights = new ArrayList<>();
+        while(scanner.hasNext()) {
+            heights.add(scanner.nextInt());
+        }
+        System.out.println(areaOfLargestRectangle(heights));
+    }
+
+    public static int areaOfLargestRectangle(List<Integer> heights) {
+        heights.add(0);
+        Stack<Integer> stack = new Stack<>();
+        int maxAreaSoFar = -1;
+        for(int height : heights) {
+            int n = 0;
+            while(!stack.isEmpty() && stack.peek() > height) {
+                n++;
+                maxAreaSoFar = Math.max(maxAreaSoFar, n* stack.pop());
+            }
+            for(int i = 0; i < n+1; i++) {
+                stack.push(height);
+            }
+        }
+        return maxAreaSoFar;
+    }
+}
diff --git a/Hackerrank/Java/Data Structures/Java Sort.java b/Hackerrank/Java/Data Structures/Java Sort.java
@@ -0,0 +1,64 @@
+import java.util.*;
+
+class Student implements Comparable {
+    private int id;
+    private String fname;
+    private double cgpa;
+    public Student(int id, String fname, double cgpa) {
+        super();
+        this.id = id;
+        this.fname = fname;
+        this.cgpa = cgpa;
+    }
+    public int getId() {
+        return id;
+    }
+    public String getFname() {
+        return fname;
+    }
+    public double getCgpa() {
+        return cgpa;
+    }
+
+    public int compareTo(Object o){
+        Student s=(Student)o;
+        if(cgpa==s.cgpa){
+            if(fname.equals(s.fname)){
+                return id-s.id;
+            }else{
+                return fname.compareTo(s.fname);
+            }
+        }else{
+            if(s.cgpa-cgpa>0)
+                return 1;
+            else
+                return -1;
+        }
+    }
+}
+
+//Complete the code
+public class Solution {
+    public static void main(String[] args){
+        Scanner in = new Scanner(System.in);
+        int testCases = Integer.parseInt(in.nextLine());
+
+        List<Student> studentList = new ArrayList<Student>();
+        while(testCases>0){
+            int id = in.nextInt();
+            String fname = in.next();
+            double cgpa = in.nextDouble();
+
+            Student st = new Student(id, fname, cgpa);
+            studentList.add(st);
+
+            testCases--;
+        }
+
+        Collections.sort(studentList);
+
+        for(Student st: studentList){
+            System.out.println(st.getFname());
+        }
+    }
+}
