Solved issue 238. All Problems organised. Links are fioxed. Readme fi…

…le updated.
abhay313 · Dec 23, 2020 · 8fd03d5 · 8fd03d5
1 parent cfaf75d
commit 8fd03d5
Show file tree

Hide file tree

Showing 71 changed files with 621 additions and 621 deletions.
diff --git a/Algorithms/Lonely Integer/solution.cpp → ... Manipulation/Lonely Integer/solution.cpp b/Algorithms/Lonely Integer/solution.cpp → ... Manipulation/Lonely Integer/solution.cpp
diff --git a/Algorithms/Lonely Integer/solution.java → ...Manipulation/Lonely Integer/solution.java b/Algorithms/Lonely Integer/solution.java → ...Manipulation/Lonely Integer/solution.java
@@ -1,45 +1,45 @@
-import java.io.*;
-import java.math.*;
-import java.security.*;
-import java.text.*;
-import java.util.*;
-import java.util.concurrent.*;
-import java.util.regex.*;
-
-public class Solution {
-
-    // The method would return the unique value in the array
-    // O(n) runtime. O(1) space. Uses XOR. Keep in mind:
-    //   1) x ^ x = 0
-    //   2) x ^ 0 = x
-    //   3) XOR is commutative and associative
-    static int lonelyinteger(int[] a) {
-        // We would XOR all the numbers in the array
-        // Only the unique number would be left
-        int val = 0;
-        for (int num : a) {
-            val = val ^ num; // ^ is XOR operator
-        }
-        return val;
-    }
-
-    /* Driver Code */
-    private static final Scanner scanner = new Scanner(System.in);
-    public static void main(String[] args) throws IOException {
-        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
-        int n = scanner.nextInt();
-        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
-        int[] a = new int[n];
-        String[] aItems = scanner.nextLine().split(" ");
-        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
-        for (int i = 0; i < n; i++) {
-            int aItem = Integer.parseInt(aItems[i]);
-            a[i] = aItem;
-        }
-        int result = lonelyinteger(a);
-        bufferedWriter.write(String.valueOf(result));
-        bufferedWriter.newLine();
-        bufferedWriter.close();
-        scanner.close();
-    }
-}
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+public class Solution {
+
+    // The method would return the unique value in the array
+    // O(n) runtime. O(1) space. Uses XOR. Keep in mind:
+    //   1) x ^ x = 0
+    //   2) x ^ 0 = x
+    //   3) XOR is commutative and associative
+    static int lonelyinteger(int[] a) {
+        // We would XOR all the numbers in the array
+        // Only the unique number would be left
+        int val = 0;
+        for (int num : a) {
+            val = val ^ num; // ^ is XOR operator
+        }
+        return val;
+    }
+
+    /* Driver Code */
+    private static final Scanner scanner = new Scanner(System.in);
+    public static void main(String[] args) throws IOException {
+        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+        int n = scanner.nextInt();
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+        int[] a = new int[n];
+        String[] aItems = scanner.nextLine().split(" ");
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+        for (int i = 0; i < n; i++) {
+            int aItem = Integer.parseInt(aItems[i]);
+            a[i] = aItem;
+        }
+        int result = lonelyinteger(a);
+        bufferedWriter.write(String.valueOf(result));
+        bufferedWriter.newLine();
+        bufferedWriter.close();
+        scanner.close();
+    }
+}
diff --git a/Algorithms/Lonely Integer/solution.py → ...t Manipulation/Lonely Integer/solution.py b/Algorithms/Lonely Integer/solution.py → ...t Manipulation/Lonely Integer/solution.py
diff --git a/...it Manipulation/Xor sequence/solution.cpp → ...it Manipulation/Xor-sequence/solution.cpp b/...it Manipulation/Xor sequence/solution.cpp → ...it Manipulation/Xor-sequence/solution.cpp
diff --git a/...t Manipulation/Xor sequence/solution.java → ...t Manipulation/Xor-sequence/solution.java b/...t Manipulation/Xor sequence/solution.java → ...t Manipulation/Xor-sequence/solution.java
@@ -1,57 +1,57 @@
-import java.io.*;
-import java.math.*;
-import java.security.*;
-import java.text.*;
-import java.util.*;
-import java.util.concurrent.*;
-import java.util.regex.*;
-
-public class Solution {
-
-    // Method to compute the value of XOR sequence
-    static long xorSequence(long l, long r) {
-        //The answer is the xor of value obtained by calc function of left and right range
-        long answer = calc(r) ^ calc(l - 1);
-        return answer;
-    }
-    //Perform xor of 7 with the limit passed and return on the basis of the conditions
-    private static long calc(long limit) {
-        switch ((int) (limit & 7)) {
-            case 0:
-                return limit;
-            case 1:
-                return limit;
-            case 2:
-                return 2;
-            case 3:
-                return 2;
-            case 4:
-                return limit + 2;
-            case 5:
-                return limit + 2;
-            case 6:
-                return 0;
-            case 7:
-                return 0;
-            default:
-                throw new RuntimeException();
-        }
-    }
-    /* Driver Code */
-    private static final Scanner scanner = new Scanner(System.in);
-    public static void main(String[] args) throws IOException {
-        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
-        int q = scanner.nextInt();
-        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
-        for (int qItr = 0; qItr < q; qItr++) {
-            String[] lr = scanner.nextLine().split(" ");
-            long l = Long.parseLong(lr[0]);
-            long r = Long.parseLong(lr[1]);
-            long result = xorSequence(l, r);
-            bufferedWriter.write(String.valueOf(result));
-            bufferedWriter.newLine();
-        }
-        bufferedWriter.close();
-        scanner.close();
-    }
-}
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+public class Solution {
+
+    // Method to compute the value of XOR sequence
+    static long xorSequence(long l, long r) {
+        //The answer is the xor of value obtained by calc function of left and right range
+        long answer = calc(r) ^ calc(l - 1);
+        return answer;
+    }
+    //Perform xor of 7 with the limit passed and return on the basis of the conditions
+    private static long calc(long limit) {
+        switch ((int) (limit & 7)) {
+            case 0:
+                return limit;
+            case 1:
+                return limit;
+            case 2:
+                return 2;
+            case 3:
+                return 2;
+            case 4:
+                return limit + 2;
+            case 5:
+                return limit + 2;
+            case 6:
+                return 0;
+            case 7:
+                return 0;
+            default:
+                throw new RuntimeException();
+        }
+    }
+    /* Driver Code */
+    private static final Scanner scanner = new Scanner(System.in);
+    public static void main(String[] args) throws IOException {
+        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+        int q = scanner.nextInt();
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+        for (int qItr = 0; qItr < q; qItr++) {
+            String[] lr = scanner.nextLine().split(" ");
+            long l = Long.parseLong(lr[0]);
+            long r = Long.parseLong(lr[1]);
+            long result = xorSequence(l, r);
+            bufferedWriter.write(String.valueOf(result));
+            bufferedWriter.newLine();
+        }
+        bufferedWriter.close();
+        scanner.close();
+    }
+}
diff --git a/...Bit Manipulation/Xor sequence/solution.py → ...Bit Manipulation/Xor-sequence/solution.py b/...Bit Manipulation/Xor sequence/solution.py → ...Bit Manipulation/Xor-sequence/solution.py
diff --git a/...thms/The coin change problem/solution.cpp → ...ming/The Coin Change Problem/solution.cpp b/...thms/The coin change problem/solution.cpp → ...ming/The Coin Change Problem/solution.cpp
diff --git a/...hms/The coin change problem/solution.java → ...ing/The Coin Change Problem/solution.java b/...hms/The coin change problem/solution.java → ...ing/The Coin Change Problem/solution.java
diff --git a/...ithms/The coin change problem/solution.py → ...mming/The Coin Change Problem/solution.py b/...ithms/The coin change problem/solution.py → ...mming/The Coin Change Problem/solution.py
diff --git a/Algorithms/Luck Balance/solution.cpp → Algorithms/Greedy/Luck Balance/solution.cpp b/Algorithms/Luck Balance/solution.cpp → Algorithms/Greedy/Luck Balance/solution.cpp
diff --git a/Algorithms/Luck Balance/solution.java → Algorithms/Greedy/Luck Balance/solution.java b/Algorithms/Luck Balance/solution.java → Algorithms/Greedy/Luck Balance/solution.java
diff --git a/Algorithms/Luck Balance/solution.py → Algorithms/Greedy/Luck Balance/solution.py b/Algorithms/Luck Balance/solution.py → Algorithms/Greedy/Luck Balance/solution.py
diff --git a/Algorithms/Marc's Cakewalk/solution.cpp → ...ithms/Greedy/Marc's Cakewalk/solution.cpp b/Algorithms/Marc's Cakewalk/solution.cpp → ...ithms/Greedy/Marc's Cakewalk/solution.cpp
diff --git a/Algorithms/Marc's Cakewalk/solution.java → ...thms/Greedy/Marc's Cakewalk/solution.java b/Algorithms/Marc's Cakewalk/solution.java → ...thms/Greedy/Marc's Cakewalk/solution.java
diff --git a/Algorithms/Marc's Cakewalk/solution.py → ...rithms/Greedy/Marc's Cakewalk/solution.py b/Algorithms/Marc's Cakewalk/solution.py → ...rithms/Greedy/Marc's Cakewalk/solution.py
diff --git a/Algorithms/Angry Professor/solution.cpp → ...plementation/Angry Professor/solution.cpp b/Algorithms/Angry Professor/solution.cpp → ...plementation/Angry Professor/solution.cpp
diff --git a/Algorithms/Angry Professor/solution.java → ...lementation/Angry Professor/solution.java b/Algorithms/Angry Professor/solution.java → ...lementation/Angry Professor/solution.java
diff --git a/Algorithms/Angry Professor/solution.py → ...mplementation/Angry Professor/solution.py b/Algorithms/Angry Professor/solution.py → ...mplementation/Angry Professor/solution.py
diff --git a/Algorithms/Apple and Orange/solution.cpp → ...lementation/Apple and Orange/solution.cpp b/Algorithms/Apple and Orange/solution.cpp → ...lementation/Apple and Orange/solution.cpp
diff --git a/Algorithms/Apple and Orange/solution.java → ...ementation/Apple and Orange/solution.java b/Algorithms/Apple and Orange/solution.java → ...ementation/Apple and Orange/solution.java
diff --git a/Algorithms/Apple and Orange/solution.py → ...plementation/Apple and Orange/solution.py b/Algorithms/Apple and Orange/solution.py → ...plementation/Apple and Orange/solution.py
diff --git a/Algorithms/Bill Division/solution.cpp → ...Implementation/Bill Division/solution.cpp b/Algorithms/Bill Division/solution.cpp → ...Implementation/Bill Division/solution.cpp
diff --git a/Algorithms/Bill Division/solution.java → ...mplementation/Bill Division/solution.java b/Algorithms/Bill Division/solution.java → ...mplementation/Bill Division/solution.java
@@ -1,29 +1,29 @@
-import java.util.*;
-
-class Solution {
-
-    public static void bonAppetit(int[] cost, int k, int charged) {        
-	int total = (charged << 1);
-        // Traverse through the cost array and subtract the current value from cost array
-        for (int i : cost) {
-            total = total - i;
-        }
-        // If total is greater than print half the cost
-	// else print Bon Appetit
-        System.out.println( (total >= 0) ? cost[k] / 2 : "Bon Appetit");
-    }
-
-    public static void main(String[] args) {
-        Scanner scan = new Scanner(System.in);
-        int n = scan.nextInt();
-        int k = scan.nextInt();
-        int[] cost = new int[n];
-        for (int i = 0; i < n; i++) {
-            cost[i] = scan.nextInt();
-        }
-        int charged = scan.nextInt();
-        scan.close();
-
-        bonAppetit(cost, k, charged);
-    }
+import java.util.*;
+
+class Solution {
+
+    public static void bonAppetit(int[] cost, int k, int charged) {        
+	int total = (charged << 1);
+        // Traverse through the cost array and subtract the current value from cost array
+        for (int i : cost) {
+            total = total - i;
+        }
+        // If total is greater than print half the cost
+	// else print Bon Appetit
+        System.out.println( (total >= 0) ? cost[k] / 2 : "Bon Appetit");
+    }
+
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int n = scan.nextInt();
+        int k = scan.nextInt();
+        int[] cost = new int[n];
+        for (int i = 0; i < n; i++) {
+            cost[i] = scan.nextInt();
+        }
+        int charged = scan.nextInt();
+        scan.close();
+
+        bonAppetit(cost, k, charged);
+    }
 }
diff --git a/Algorithms/Bill Division/solution.py → .../Implementation/Bill Division/solution.py b/Algorithms/Bill Division/solution.py → .../Implementation/Bill Division/solution.py
diff --git a/Algorithms/Breaking the Records/solution.cpp → ...ntation/Breaking the Records/solution.cpp b/Algorithms/Breaking the Records/solution.cpp → ...ntation/Breaking the Records/solution.cpp