Add CTCI folder

rajatgoyal715 · rajatgoyal715 · commit bd51949fda4c · 2018-07-31T11:48:36.000+05:30
diff --git a/CrackingTheCodingInterview/DetectACycle.java b/CrackingTheCodingInterview/DetectACycle.java
@@ -0,0 +1,21 @@
+/*
+Detect a cycle in a linked list. Note that the head pointer may be 'null' if the list is empty.
+
+A Node is defined as: 
+    class Node {
+        int data;
+        Node next;
+    }
+*/
+
+boolean hasCycle(Node head) {
+    Node slow_p = head, fast_p = head;
+    while(slow_p!= null && fast_p!= null && fast_p.next!=null) {
+        slow_p = slow_p.next;
+        fast_p = fast_p.next.next;
+        if(slow_p == fast_p){
+            return true;
+        }
+    }
+    return false;
+}
diff --git a/CrackingTheCodingInterview/LeftRotation.java b/CrackingTheCodingInterview/LeftRotation.java
@@ -0,0 +1,19 @@
+import java.io.*;
+import java.util.*;
+
+public class LeftRotation {
+
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int d = sc.nextInt();
+        int a[] = new int[n];
+        for (int i = 0; i < n; i++)
+            a[i] = sc.nextInt();
+        for (int i = d; i < n; i++)
+            System.out.print(a[i] + " ");
+        for (int i = 0; i < d; i++)
+            System.out.print(a[i] + " ");
+    }
+
+}
diff --git a/CrackingTheCodingInterview/MakingAnagrams.java b/CrackingTheCodingInterview/MakingAnagrams.java
@@ -0,0 +1,29 @@
+import java.io.*;
+import java.util.*;
+
+public class MakingAnagrams {
+
+    public static int numberNeeded(String first, String second) {
+        int a[] = new int[26];
+        int b[] = new int[26];
+        for (int i = 0; i < first.length(); i++) {
+            a[first.charAt(i) - 97]++;
+        }
+        for (int i = 0; i < second.length(); i++) {
+            b[second.charAt(i) - 97]++;
+        }
+        int count = 0;
+        for (int i = 0; i < 26; i++) {
+            count += Math.abs(a[i] - b[i]);
+        }
+        return count;
+    }
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        String a = in.next();
+        String b = in.next();
+        System.out.println(numberNeeded(a, b));
+    }
+
+}
diff --git a/CrackingTheCodingInterview/Primality.java b/CrackingTheCodingInterview/Primality.java
@@ -0,0 +1,25 @@
+import java.io.*;
+import java.util.*;
+import java.text.*;
+import java.math.*;
+import java.util.regex.*;
+
+public class Primality {
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        int p = in.nextInt();
+        for (int a0 = 0; a0 < p; a0++) {
+            int n = in.nextInt();
+            int count = 0;
+            for (int i = 2; i <= Math.sqrt(n); i++) {
+                if (n % i == 0) {
+                    count++;
+                    break;
+                }
+            }
+            System.out.println((count != 0 || n == 1) ? "Not prime" : "Prime");
+        }
+    }
+
+}
diff --git a/CrackingTheCodingInterview/RansomNote.java b/CrackingTheCodingInterview/RansomNote.java
@@ -0,0 +1,31 @@
+import java.io.*;
+import java.util.*;
+
+public class RansomNote {
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        int m = in.nextInt();
+        int n = in.nextInt();
+        HashMap<String, Integer> map = new HashMap<String, Integer>();
+        String magazine[] = new String[m];
+        for (int magazine_i = 0; magazine_i < m; magazine_i++) {
+            magazine[magazine_i] = in.next();
+            int count = (map.get(magazine[magazine_i]) != null) ? map.get(magazine[magazine_i]) : 0;
+            map.put(magazine[magazine_i], count + 1);
+        }
+        boolean possible = true;
+        String ransom[] = new String[n];
+        for (int ransom_i = 0; ransom_i < n; ransom_i++) {
+            ransom[ransom_i] = in.next();
+            if (map.get(ransom[ransom_i]) == null || map.get(ransom[ransom_i]) == 0) {
+                possible = false;
+                break;
+            } else {
+                map.put(ransom[ransom_i], map.get(ransom[ransom_i]) - 1);
+            }
+        }
+        System.out.println((possible) ? "Yes" : "No");
+    }
+    
+}
