Solved 3 problems in HR

varunu28 · varunu28 · commit 7b040ccfec7e · 2017-11-14T18:10:11.000-08:00
diff --git a/Hackerrank/30 Days of Code/Day 24.java b/Hackerrank/30 Days of Code/Day 24.java
@@ -0,0 +1,67 @@
+import java.io.*;
+import java.util.*;
+class Node{
+	int data;
+	Node next;
+	Node(int d){
+        data=d;
+        next=null;
+    }
+	
+}
+class Solution
+{
+    public static Node removeDuplicates(Node head) {
+        Node curr = head;
+        
+        while (curr != null) {
+            if (curr.next != null && curr.data == curr.next.data) {
+                curr.next = curr.next.next;
+            }
+            else {
+                curr = curr.next;
+            }
+        }
+        
+        return head;
+    }
+	 public static  Node insert(Node head,int data)
+     {
+        Node p=new Node(data);			
+        if(head==null)
+            head=p;
+        else if(head.next==null)
+            head.next=p;
+        else
+        {
+            Node start=head;
+            while(start.next!=null)
+                start=start.next;
+            start.next=p;
+
+        }
+        return head;
+    }
+    public static void display(Node head)
+        {
+              Node start=head;
+              while(start!=null)
+              {
+                  System.out.print(start.data+" ");
+                  start=start.next;
+              }
+        }
+        public static void main(String args[])
+        {
+              Scanner sc=new Scanner(System.in);
+              Node head=null;
+              int T=sc.nextInt();
+              while(T-->0){
+                  int ele=sc.nextInt();
+                  head=insert(head,ele);
+              }
+              head=removeDuplicates(head);
+              display(head);
+
+       }
+    }
diff --git a/Hackerrank/30 Days of Code/Day 25.java b/Hackerrank/30 Days of Code/Day 25.java
@@ -0,0 +1,30 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    public static void main(String[] args) throws Exception {
+        
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+
+        int n = Integer.parseInt(br.readLine());
+        for(int i=0;i<n;i++) {
+            int num = Integer.parseInt(br.readLine());
+            System.out.println(isPrime(num) ? "Prime" : "Not prime");
+        }
+    }
+    
+    public static boolean isPrime(int n) {
+        if (n < 2) return false;
+        if (n == 2 || n == 3) return true;
+        if (n % 2 == 0 || n % 3 == 0) return false;
+        
+        for (int i=5; i <= (int)Math.sqrt(n); i++) {
+            if (n%i == 0) {
+                return false;
+            }
+        }
+        
+        return true;
+    }
+}
diff --git a/Hackerrank/30 Days of Code/Day 26.java b/Hackerrank/30 Days of Code/Day 26.java
@@ -0,0 +1,37 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+ 
+        String[] strs = br.readLine().trim().split("\\s+");
+        
+        int[] dayReturned = new int[3];
+        for (int i=0;i<3;i++) {
+            dayReturned[i] = Integer.parseInt(strs[i]);
+        }
+        
+        strs = br.readLine().trim().split("\\s+");
+        
+        int[] actualDayReturned = new int[3];
+        for (int i=0;i<3;i++) {
+            actualDayReturned[i] = Integer.parseInt(strs[i]);
+        }
+        
+        int fine = 0;
+        
+        if(dayReturned[2] == actualDayReturned[2] && dayReturned[1] == actualDayReturned[1] && dayReturned[0] > actualDayReturned[0]) {
+            fine += 15*(dayReturned[0] - actualDayReturned[0]);
+        }
+        else if(dayReturned[2] == actualDayReturned[2] && dayReturned[1] > actualDayReturned[1]) {
+            fine += 500*(dayReturned[1] - actualDayReturned[1]);
+        }
+        else if (dayReturned[2] > actualDayReturned[2]) {
+            fine = 10000;
+        }
+        
+        System.out.println(fine);
+    }
+}
